./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/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_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/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_98dd74c5-d00e-4bd7-bd4b-c9536147a351/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 b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:10:08,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:10:09,049 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 18:10:09,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:10:09,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:10:09,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:10:09,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:10:09,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:10:09,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:10:09,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:10:09,083 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:10:09,083 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:10:09,084 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:10:09,084 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:10:09,085 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:10:09,085 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:10:09,086 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:10:09,086 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:10:09,087 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:10:09,088 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:10:09,088 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:10:09,089 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:10:09,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:10:09,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:10:09,091 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:10:09,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:10:09,092 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:10:09,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:10:09,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:10:09,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:10:09,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:10:09,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:10:09,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:10:09,095 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:10:09,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:10:09,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:10:09,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:10:09,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:10:09,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:10:09,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:10:09,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:10:09,097 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:10:09,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:10:09,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:10:09,097 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:10:09,097 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:10:09,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:10:09,098 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_98dd74c5-d00e-4bd7-bd4b-c9536147a351/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_98dd74c5-d00e-4bd7-bd4b-c9536147a351/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 -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2023-12-02 18:10:09,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:10:09,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:10:09,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:10:09,325 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:10:09,326 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:10:09,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-12-02 18:10:12,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:10:12,370 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:10:12,371 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-12-02 18:10:12,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/data/a770f23aa/ed61e07bd2074f32bdd61587228f9ce4/FLAG9ee5cd41a [2023-12-02 18:10:12,397 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/data/a770f23aa/ed61e07bd2074f32bdd61587228f9ce4 [2023-12-02 18:10:12,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:10:12,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:10:12,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:10:12,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:10:12,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:10:12,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5b0c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12, skipping insertion in model container [2023-12-02 18:10:12,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:10:12,632 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_98dd74c5-d00e-4bd7-bd4b-c9536147a351/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-12-02 18:10:12,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:10:12,817 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:10:12,827 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_98dd74c5-d00e-4bd7-bd4b-c9536147a351/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-12-02 18:10:12,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:10:12,908 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:10:12,908 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:10:12,914 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:10:12,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12 WrapperNode [2023-12-02 18:10:12,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:10:12,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:10:12,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:10:12,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:10:12,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,964 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-12-02 18:10:12,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:10:12,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:10:12,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:10:12,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:10:12,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:12,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:13,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:10:13,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:10:13,002 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:10:13,002 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:10:13,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (1/1) ... [2023-12-02 18:10:13,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:10:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:10:13,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:10:13,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:10:13,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 18:10:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 18:10:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:10:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:10:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:10:13,075 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 18:10:13,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 18:10:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 18:10:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 18:10:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 18:10:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 18:10:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-02 18:10:13,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-02 18:10:13,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:10:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 18:10:13,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:10:13,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:10:13,078 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 18:10:13,225 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:10:13,228 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:10:13,585 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:10:13,791 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:10:13,791 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 18:10:13,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:10:13 BoogieIcfgContainer [2023-12-02 18:10:13,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:10:13,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:10:13,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:10:13,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:10:13,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:10:12" (1/3) ... [2023-12-02 18:10:13,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24609eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:10:13, skipping insertion in model container [2023-12-02 18:10:13,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:10:12" (2/3) ... [2023-12-02 18:10:13,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24609eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:10:13, skipping insertion in model container [2023-12-02 18:10:13,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:10:13" (3/3) ... [2023-12-02 18:10:13,802 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-12-02 18:10:13,812 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 18:10:13,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:10:13,822 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 18:10:13,822 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 18:10:13,895 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 18:10:13,930 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 50 transitions, 116 flow [2023-12-02 18:10:15,344 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35986 states, 35983 states have (on average 4.375399494205597) internal successors, (157440), 35985 states have internal predecessors, (157440), 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 18:10:15,365 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:10:15,372 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;@790a4845, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:10:15,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-02 18:10:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 35986 states, 35983 states have (on average 4.375399494205597) internal successors, (157440), 35985 states have internal predecessors, (157440), 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 18:10:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 18:10:15,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:15,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 18:10:15,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:15,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:15,489 INFO L85 PathProgramCache]: Analyzing trace with hash 12304696, now seen corresponding path program 1 times [2023-12-02 18:10:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445546466] [2023-12-02 18:10:15,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:15,979 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 18:10:15,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:15,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445546466] [2023-12-02 18:10:15,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445546466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:15,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:15,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 18:10:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831348710] [2023-12-02 18:10:15,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:10:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:10:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:10:16,082 INFO L87 Difference]: Start difference. First operand has 35986 states, 35983 states have (on average 4.375399494205597) internal successors, (157440), 35985 states have internal predecessors, (157440), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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 18:10:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:16,990 INFO L93 Difference]: Finished difference Result 30928 states and 133372 transitions. [2023-12-02 18:10:16,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:10:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-12-02 18:10:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:17,457 INFO L225 Difference]: With dead ends: 30928 [2023-12-02 18:10:17,457 INFO L226 Difference]: Without dead ends: 29136 [2023-12-02 18:10:17,459 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 18:10:17,462 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:17,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29136 states. [2023-12-02 18:10:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29136 to 29136. [2023-12-02 18:10:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29136 states, 29135 states have (on average 4.3251072593101085) internal successors, (126012), 29135 states have internal predecessors, (126012), 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 18:10:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29136 states to 29136 states and 126012 transitions. [2023-12-02 18:10:19,269 INFO L78 Accepts]: Start accepts. Automaton has 29136 states and 126012 transitions. Word has length 4 [2023-12-02 18:10:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:19,270 INFO L495 AbstractCegarLoop]: Abstraction has 29136 states and 126012 transitions. [2023-12-02 18:10:19,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 18:10:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 29136 states and 126012 transitions. [2023-12-02 18:10:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 18:10:19,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:19,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:19,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:10:19,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:19,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:19,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1608703236, now seen corresponding path program 1 times [2023-12-02 18:10:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:19,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691416140] [2023-12-02 18:10:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:19,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:19,651 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 18:10:19,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:19,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691416140] [2023-12-02 18:10:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691416140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:19,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:10:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465624267] [2023-12-02 18:10:19,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:19,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:10:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:19,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:10:19,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:10:19,656 INFO L87 Difference]: Start difference. First operand 29136 states and 126012 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 18:10:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:21,056 INFO L93 Difference]: Finished difference Result 61552 states and 260092 transitions. [2023-12-02 18:10:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:10:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 18:10:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:21,500 INFO L225 Difference]: With dead ends: 61552 [2023-12-02 18:10:21,501 INFO L226 Difference]: Without dead ends: 47280 [2023-12-02 18:10:21,501 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 18:10:21,503 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 109 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:21,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 157 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:10:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47280 states. [2023-12-02 18:10:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47280 to 37680. [2023-12-02 18:10:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37680 states, 37679 states have (on average 4.261047267708803) internal successors, (160552), 37679 states have internal predecessors, (160552), 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 18:10:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37680 states to 37680 states and 160552 transitions. [2023-12-02 18:10:23,465 INFO L78 Accepts]: Start accepts. Automaton has 37680 states and 160552 transitions. Word has length 16 [2023-12-02 18:10:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:23,466 INFO L495 AbstractCegarLoop]: Abstraction has 37680 states and 160552 transitions. [2023-12-02 18:10:23,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 18:10:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 37680 states and 160552 transitions. [2023-12-02 18:10:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 18:10:23,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:23,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:23,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:10:23,495 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:23,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 520076421, now seen corresponding path program 1 times [2023-12-02 18:10:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:23,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023225864] [2023-12-02 18:10:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:23,755 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 18:10:23,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:23,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023225864] [2023-12-02 18:10:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023225864] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:10:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552089135] [2023-12-02 18:10:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:23,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:10:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:10:23,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:10:23,759 INFO L87 Difference]: Start difference. First operand 37680 states and 160552 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:10:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:24,834 INFO L93 Difference]: Finished difference Result 49240 states and 205172 transitions. [2023-12-02 18:10:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:10:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-02 18:10:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:24,999 INFO L225 Difference]: With dead ends: 49240 [2023-12-02 18:10:25,000 INFO L226 Difference]: Without dead ends: 40160 [2023-12-02 18:10:25,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:10:25,001 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 139 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:25,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 223 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:10:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40160 states. [2023-12-02 18:10:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40160 to 29232. [2023-12-02 18:10:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29232 states, 29231 states have (on average 4.2305771270226815) internal successors, (123664), 29231 states have internal predecessors, (123664), 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 18:10:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29232 states to 29232 states and 123664 transitions. [2023-12-02 18:10:26,150 INFO L78 Accepts]: Start accepts. Automaton has 29232 states and 123664 transitions. Word has length 18 [2023-12-02 18:10:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:26,151 INFO L495 AbstractCegarLoop]: Abstraction has 29232 states and 123664 transitions. [2023-12-02 18:10:26,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:10:26,151 INFO L276 IsEmpty]: Start isEmpty. Operand 29232 states and 123664 transitions. [2023-12-02 18:10:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 18:10:26,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:26,169 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 18:10:26,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:10:26,169 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:26,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1032416539, now seen corresponding path program 1 times [2023-12-02 18:10:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:26,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869666773] [2023-12-02 18:10:26,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:26,325 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 18:10:26,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869666773] [2023-12-02 18:10:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869666773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:26,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:26,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:10:26,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147172100] [2023-12-02 18:10:26,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:26,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:10:26,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:10:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:10:26,327 INFO L87 Difference]: Start difference. First operand 29232 states and 123664 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 18:10:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:27,126 INFO L93 Difference]: Finished difference Result 30212 states and 126373 transitions. [2023-12-02 18:10:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:10:27,127 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 18:10:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:27,253 INFO L225 Difference]: With dead ends: 30212 [2023-12-02 18:10:27,253 INFO L226 Difference]: Without dead ends: 26292 [2023-12-02 18:10:27,254 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 18:10:27,255 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 100 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:27,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 131 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:10:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26292 states. [2023-12-02 18:10:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26292 to 23292. [2023-12-02 18:10:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23292 states, 23291 states have (on average 4.192263105920742) internal successors, (97642), 23291 states have internal predecessors, (97642), 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 18:10:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23292 states to 23292 states and 97642 transitions. [2023-12-02 18:10:28,134 INFO L78 Accepts]: Start accepts. Automaton has 23292 states and 97642 transitions. Word has length 19 [2023-12-02 18:10:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:28,135 INFO L495 AbstractCegarLoop]: Abstraction has 23292 states and 97642 transitions. [2023-12-02 18:10:28,135 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 18:10:28,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23292 states and 97642 transitions. [2023-12-02 18:10:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 18:10:28,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:28,156 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 18:10:28,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:10:28,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:28,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:28,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2132398455, now seen corresponding path program 1 times [2023-12-02 18:10:28,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:28,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913954722] [2023-12-02 18:10:28,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:28,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:28,310 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 18:10:28,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913954722] [2023-12-02 18:10:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913954722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:28,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:28,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:10:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125413698] [2023-12-02 18:10:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:10:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:28,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:10:28,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:10:28,313 INFO L87 Difference]: Start difference. First operand 23292 states and 97642 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 18:10:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:28,860 INFO L93 Difference]: Finished difference Result 22948 states and 91416 transitions. [2023-12-02 18:10:28,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:10:28,861 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 18:10:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:28,952 INFO L225 Difference]: With dead ends: 22948 [2023-12-02 18:10:28,952 INFO L226 Difference]: Without dead ends: 19452 [2023-12-02 18:10:28,952 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 18:10:28,954 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 82 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:28,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 49 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19452 states. [2023-12-02 18:10:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19452 to 19452. [2023-12-02 18:10:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19452 states, 19451 states have (on average 4.038969718780526) internal successors, (78562), 19451 states have internal predecessors, (78562), 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 18:10:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 78562 transitions. [2023-12-02 18:10:29,431 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 78562 transitions. Word has length 22 [2023-12-02 18:10:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:29,432 INFO L495 AbstractCegarLoop]: Abstraction has 19452 states and 78562 transitions. [2023-12-02 18:10:29,432 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 18:10:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 78562 transitions. [2023-12-02 18:10:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 18:10:29,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:29,596 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] [2023-12-02 18:10:29,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 18:10:29,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:29,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1232657467, now seen corresponding path program 1 times [2023-12-02 18:10:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113690110] [2023-12-02 18:10:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:29,817 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 18:10:29,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:29,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113690110] [2023-12-02 18:10:29,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113690110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:29,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:10:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620543678] [2023-12-02 18:10:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:10:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:10:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:10:29,821 INFO L87 Difference]: Start difference. First operand 19452 states and 78562 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 18:10:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:30,076 INFO L93 Difference]: Finished difference Result 15596 states and 59654 transitions. [2023-12-02 18:10:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:10:30,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2023-12-02 18:10:30,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:30,117 INFO L225 Difference]: With dead ends: 15596 [2023-12-02 18:10:30,117 INFO L226 Difference]: Without dead ends: 13080 [2023-12-02 18:10:30,117 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 18:10:30,118 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 150 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:30,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 61 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:10:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13080 states. [2023-12-02 18:10:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13080 to 13032. [2023-12-02 18:10:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13032 states, 13031 states have (on average 3.8348553449466656) internal successors, (49972), 13031 states have internal predecessors, (49972), 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 18:10:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13032 states to 13032 states and 49972 transitions. [2023-12-02 18:10:30,578 INFO L78 Accepts]: Start accepts. Automaton has 13032 states and 49972 transitions. Word has length 25 [2023-12-02 18:10:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:30,578 INFO L495 AbstractCegarLoop]: Abstraction has 13032 states and 49972 transitions. [2023-12-02 18:10:30,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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 18:10:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 13032 states and 49972 transitions. [2023-12-02 18:10:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 18:10:30,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:30,605 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] [2023-12-02 18:10:30,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 18:10:30,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:30,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash -928546978, now seen corresponding path program 1 times [2023-12-02 18:10:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:30,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686616783] [2023-12-02 18:10:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:30,901 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 18:10:30,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686616783] [2023-12-02 18:10:30,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686616783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:30,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:30,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:10:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744255826] [2023-12-02 18:10:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:30,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:10:30,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:30,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:10:30,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:10:30,903 INFO L87 Difference]: Start difference. First operand 13032 states and 49972 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 18:10:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:31,187 INFO L93 Difference]: Finished difference Result 10088 states and 38004 transitions. [2023-12-02 18:10:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:10:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 28 [2023-12-02 18:10:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:31,218 INFO L225 Difference]: With dead ends: 10088 [2023-12-02 18:10:31,218 INFO L226 Difference]: Without dead ends: 8768 [2023-12-02 18:10:31,218 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 18:10:31,219 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 218 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:31,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 73 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:10:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8768 states. [2023-12-02 18:10:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8768 to 8352. [2023-12-02 18:10:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8352 states, 8351 states have (on average 3.773919291102862) internal successors, (31516), 8351 states have internal predecessors, (31516), 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 18:10:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8352 states to 8352 states and 31516 transitions. [2023-12-02 18:10:31,471 INFO L78 Accepts]: Start accepts. Automaton has 8352 states and 31516 transitions. Word has length 28 [2023-12-02 18:10:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:31,472 INFO L495 AbstractCegarLoop]: Abstraction has 8352 states and 31516 transitions. [2023-12-02 18:10:31,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 18:10:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8352 states and 31516 transitions. [2023-12-02 18:10:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:10:31,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:31,496 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, 1, 1, 1, 1] [2023-12-02 18:10:31,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 18:10:31,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:31,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1872040538, now seen corresponding path program 1 times [2023-12-02 18:10:31,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:31,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562010969] [2023-12-02 18:10:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:32,087 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 18:10:32,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562010969] [2023-12-02 18:10:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562010969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:32,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 18:10:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509818093] [2023-12-02 18:10:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:32,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:10:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:10:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:10:32,089 INFO L87 Difference]: Start difference. First operand 8352 states and 31516 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 18:10:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:32,753 INFO L93 Difference]: Finished difference Result 14550 states and 54212 transitions. [2023-12-02 18:10:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:10:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 33 [2023-12-02 18:10:32,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:32,789 INFO L225 Difference]: With dead ends: 14550 [2023-12-02 18:10:32,789 INFO L226 Difference]: Without dead ends: 12262 [2023-12-02 18:10:32,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:10:32,791 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 100 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:32,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 402 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:10:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12262 states. [2023-12-02 18:10:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12262 to 10382. [2023-12-02 18:10:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10382 states, 10381 states have (on average 3.7264232732877374) internal successors, (38684), 10381 states have internal predecessors, (38684), 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 18:10:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 38684 transitions. [2023-12-02 18:10:33,046 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 38684 transitions. Word has length 33 [2023-12-02 18:10:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:33,046 INFO L495 AbstractCegarLoop]: Abstraction has 10382 states and 38684 transitions. [2023-12-02 18:10:33,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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 18:10:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 38684 transitions. [2023-12-02 18:10:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:10:33,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:33,070 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, 1, 1, 1, 1] [2023-12-02 18:10:33,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 18:10:33,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:33,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1834379636, now seen corresponding path program 2 times [2023-12-02 18:10:33,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:33,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165784152] [2023-12-02 18:10:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:33,961 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 18:10:33,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:33,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165784152] [2023-12-02 18:10:33,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165784152] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:33,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:33,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 18:10:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526840954] [2023-12-02 18:10:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:33,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 18:10:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 18:10:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:10:33,963 INFO L87 Difference]: Start difference. First operand 10382 states and 38684 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 18:10:34,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:34,609 INFO L93 Difference]: Finished difference Result 15698 states and 57101 transitions. [2023-12-02 18:10:34,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:10:34,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 33 [2023-12-02 18:10:34,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:34,668 INFO L225 Difference]: With dead ends: 15698 [2023-12-02 18:10:34,668 INFO L226 Difference]: Without dead ends: 13890 [2023-12-02 18:10:34,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-02 18:10:34,669 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 143 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:34,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 423 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:10:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13890 states. [2023-12-02 18:10:34,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13890 to 10230. [2023-12-02 18:10:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10230 states, 10229 states have (on average 3.7250953172353114) internal successors, (38104), 10229 states have internal predecessors, (38104), 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 18:10:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10230 states to 10230 states and 38104 transitions. [2023-12-02 18:10:35,033 INFO L78 Accepts]: Start accepts. Automaton has 10230 states and 38104 transitions. Word has length 33 [2023-12-02 18:10:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:35,034 INFO L495 AbstractCegarLoop]: Abstraction has 10230 states and 38104 transitions. [2023-12-02 18:10:35,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 18:10:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10230 states and 38104 transitions. [2023-12-02 18:10:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:10:35,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:35,054 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, 1, 1, 1, 1] [2023-12-02 18:10:35,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 18:10:35,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:35,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 756009060, now seen corresponding path program 3 times [2023-12-02 18:10:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328829663] [2023-12-02 18:10:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:35,308 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 18:10:35,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328829663] [2023-12-02 18:10:35,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328829663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:35,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:35,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:10:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563801185] [2023-12-02 18:10:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:35,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:10:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:35,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:10:35,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:10:35,310 INFO L87 Difference]: Start difference. First operand 10230 states and 38104 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 18:10:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:35,609 INFO L93 Difference]: Finished difference Result 9286 states and 34816 transitions. [2023-12-02 18:10:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:10:35,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 33 [2023-12-02 18:10:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:35,633 INFO L225 Difference]: With dead ends: 9286 [2023-12-02 18:10:35,633 INFO L226 Difference]: Without dead ends: 6616 [2023-12-02 18:10:35,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:10:35,634 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 246 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:35,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 58 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:10:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2023-12-02 18:10:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 6336. [2023-12-02 18:10:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6335 states have (on average 3.7146014206787688) internal successors, (23532), 6335 states have internal predecessors, (23532), 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 18:10:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 23532 transitions. [2023-12-02 18:10:35,887 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 23532 transitions. Word has length 33 [2023-12-02 18:10:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:35,887 INFO L495 AbstractCegarLoop]: Abstraction has 6336 states and 23532 transitions. [2023-12-02 18:10:35,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 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 18:10:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 23532 transitions. [2023-12-02 18:10:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 18:10:35,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:35,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:35,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 18:10:35,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:35,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:35,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1173949680, now seen corresponding path program 1 times [2023-12-02 18:10:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156312952] [2023-12-02 18:10:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:36,154 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 18:10:36,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156312952] [2023-12-02 18:10:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156312952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:10:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063906970] [2023-12-02 18:10:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:36,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:10:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:36,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:10:36,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:10:36,157 INFO L87 Difference]: Start difference. First operand 6336 states and 23532 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 18:10:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:36,521 INFO L93 Difference]: Finished difference Result 10322 states and 38166 transitions. [2023-12-02 18:10:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:10:36,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2023-12-02 18:10:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:36,545 INFO L225 Difference]: With dead ends: 10322 [2023-12-02 18:10:36,545 INFO L226 Difference]: Without dead ends: 6882 [2023-12-02 18:10:36,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:10:36,546 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:36,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 137 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:10:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2023-12-02 18:10:36,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 4768. [2023-12-02 18:10:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4767 states have (on average 3.615691210404867) internal successors, (17236), 4767 states have internal predecessors, (17236), 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 18:10:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 17236 transitions. [2023-12-02 18:10:36,680 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 17236 transitions. Word has length 38 [2023-12-02 18:10:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:36,680 INFO L495 AbstractCegarLoop]: Abstraction has 4768 states and 17236 transitions. [2023-12-02 18:10:36,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 18:10:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 17236 transitions. [2023-12-02 18:10:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 18:10:36,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:36,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:36,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 18:10:36,691 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:36,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1211610582, now seen corresponding path program 2 times [2023-12-02 18:10:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:36,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420712636] [2023-12-02 18:10:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:37,042 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 18:10:37,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420712636] [2023-12-02 18:10:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420712636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:37,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 18:10:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536587795] [2023-12-02 18:10:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:37,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:10:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:10:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:10:37,044 INFO L87 Difference]: Start difference. First operand 4768 states and 17236 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 18:10:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:37,423 INFO L93 Difference]: Finished difference Result 9024 states and 32310 transitions. [2023-12-02 18:10:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:10:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 38 [2023-12-02 18:10:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:37,434 INFO L225 Difference]: With dead ends: 9024 [2023-12-02 18:10:37,434 INFO L226 Difference]: Without dead ends: 4436 [2023-12-02 18:10:37,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:10:37,435 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 99 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:37,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 165 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:10:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2023-12-02 18:10:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3368. [2023-12-02 18:10:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3367 states have (on average 3.527175527175527) internal successors, (11876), 3367 states have internal predecessors, (11876), 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 18:10:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 11876 transitions. [2023-12-02 18:10:37,526 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 11876 transitions. Word has length 38 [2023-12-02 18:10:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:37,526 INFO L495 AbstractCegarLoop]: Abstraction has 3368 states and 11876 transitions. [2023-12-02 18:10:37,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 18:10:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 11876 transitions. [2023-12-02 18:10:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 18:10:37,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:37,532 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:37,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 18:10:37,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:37,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:37,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1217091782, now seen corresponding path program 3 times [2023-12-02 18:10:37,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992335620] [2023-12-02 18:10:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:37,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:37,798 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 18:10:37,798 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992335620] [2023-12-02 18:10:37,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992335620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:37,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:37,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:10:37,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944703046] [2023-12-02 18:10:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:37,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:10:37,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:37,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:10:37,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:10:37,800 INFO L87 Difference]: Start difference. First operand 3368 states and 11876 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 18:10:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:38,040 INFO L93 Difference]: Finished difference Result 5332 states and 18668 transitions. [2023-12-02 18:10:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:10:38,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2023-12-02 18:10:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:38,048 INFO L225 Difference]: With dead ends: 5332 [2023-12-02 18:10:38,048 INFO L226 Difference]: Without dead ends: 3460 [2023-12-02 18:10:38,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 18:10:38,049 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:38,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 122 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:10:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2023-12-02 18:10:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 2868. [2023-12-02 18:10:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2867 states have (on average 3.4579700034879663) internal successors, (9914), 2867 states have internal predecessors, (9914), 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 18:10:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 9914 transitions. [2023-12-02 18:10:38,115 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 9914 transitions. Word has length 38 [2023-12-02 18:10:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:38,115 INFO L495 AbstractCegarLoop]: Abstraction has 2868 states and 9914 transitions. [2023-12-02 18:10:38,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 18:10:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 9914 transitions. [2023-12-02 18:10:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 18:10:38,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:38,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:38,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 18:10:38,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:38,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash 240721722, now seen corresponding path program 4 times [2023-12-02 18:10:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376074819] [2023-12-02 18:10:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:10:39,022 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 18:10:39,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:10:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376074819] [2023-12-02 18:10:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376074819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:10:39,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:10:39,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 18:10:39,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350591258] [2023-12-02 18:10:39,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:10:39,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:10:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:10:39,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:10:39,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:10:39,024 INFO L87 Difference]: Start difference. First operand 2868 states and 9914 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 18:10:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:10:39,473 INFO L93 Difference]: Finished difference Result 4218 states and 14434 transitions. [2023-12-02 18:10:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 18:10:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 38 [2023-12-02 18:10:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:10:39,484 INFO L225 Difference]: With dead ends: 4218 [2023-12-02 18:10:39,484 INFO L226 Difference]: Without dead ends: 3260 [2023-12-02 18:10:39,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2023-12-02 18:10:39,485 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 115 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:10:39,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 237 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:10:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2023-12-02 18:10:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2688. [2023-12-02 18:10:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2688 states, 2687 states have (on average 3.4328247115742463) internal successors, (9224), 2687 states have internal predecessors, (9224), 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 18:10:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 9224 transitions. [2023-12-02 18:10:39,564 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 9224 transitions. Word has length 38 [2023-12-02 18:10:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:10:39,565 INFO L495 AbstractCegarLoop]: Abstraction has 2688 states and 9224 transitions. [2023-12-02 18:10:39,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 18:10:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 9224 transitions. [2023-12-02 18:10:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 18:10:39,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:10:39,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:39,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 18:10:39,570 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-12-02 18:10:39,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:10:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1402361432, now seen corresponding path program 5 times [2023-12-02 18:10:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:10:39,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544219191] [2023-12-02 18:10:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:10:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:10:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:10:39,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 18:10:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:10:39,719 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 18:10:39,720 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 18:10:39,720 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-02 18:10:39,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-02 18:10:39,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-12-02 18:10:39,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-12-02 18:10:39,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-12-02 18:10:39,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-12-02 18:10:39,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-02 18:10:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 18:10:39,725 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:10:39,729 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 18:10:39,730 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:10:39,783 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 18:10:39,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 18:10:39,786 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 18:10:39,788 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-12-02 18:10:39,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:10:39 BasicIcfg [2023-12-02 18:10:39,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:10:39,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:10:39,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:10:39,819 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:10:39,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:10:13" (3/4) ... [2023-12-02 18:10:39,820 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 18:10:39,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 18:10:39,843 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 18:10:39,844 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-12-02 18:10:39,845 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-12-02 18:10:39,911 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 18:10:39,911 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:10:39,912 INFO L158 Benchmark]: Toolchain (without parser) took 27510.65ms. Allocated memory was 142.6MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 100.1MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-12-02 18:10:39,912 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:10:39,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.19ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 75.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 18:10:39,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.37ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 72.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:10:39,913 INFO L158 Benchmark]: Boogie Preprocessor took 35.37ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:10:39,913 INFO L158 Benchmark]: RCFGBuilder took 790.60ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-12-02 18:10:39,914 INFO L158 Benchmark]: TraceAbstraction took 26022.88ms. Allocated memory was 142.6MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 67.9MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-12-02 18:10:39,914 INFO L158 Benchmark]: Witness Printer took 92.34ms. Allocated memory is still 10.2GB. Free memory was 8.7GB in the beginning and 8.7GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-12-02 18:10:39,916 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.19ms. Allocated memory is still 104.9MB. Free memory is still 56.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.19ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 75.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.37ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 72.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.37ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 790.60ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 68.7MB in the end (delta: 2.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26022.88ms. Allocated memory was 142.6MB in the beginning and 10.2GB in the end (delta: 10.1GB). Free memory was 67.9MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 92.34ms. Allocated memory is still 10.2GB. Free memory was 8.7GB in the beginning and 8.7GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t601={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={6:0}, t602={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={6:0}, t602={7:0}, t603={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={6:0}, t602={7:0}, t603={8:0}, t604={5:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=0, z=0] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=1, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=1, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=1, x=2, y=1, z=2] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, 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$$choice2=1, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, 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$$choice2=1, x=2, y=1, z=2] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={6:0}, t602={7:0}, t603={8:0}, t604={5:0}, weak$$choice2=1, x=2, y=1, z=2] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={6:0}, t602={7:0}, t603={8:0}, t604={5:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={6:0}, t602={7:0}, t603={8:0}, t604={5:0}, weak$$choice2=1, x=2, y=1, z=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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: 870]: 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: 874]: 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: 872]: 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: 876]: 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 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.5s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1649 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1649 mSDsluCounter, 2278 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1724 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2888 IncrementalHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 554 mSDtfsCounter, 2888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37680occurred in iteration=2, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 34158 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 2592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 18:10:39,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98dd74c5-d00e-4bd7-bd4b-c9536147a351/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