./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 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_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:15:45,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:15:46,080 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:15:46,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:15:46,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:15:46,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:15:46,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:15:46,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:15:46,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:15:46,115 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:15:46,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:15:46,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:15:46,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:15:46,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:15:46,118 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:15:46,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:15:46,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:15:46,120 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:15:46,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:15:46,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:15:46,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:15:46,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:15:46,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:15:46,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:15:46,124 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:15:46,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:15:46,125 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:15:46,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:15:46,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:15:46,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:15:46,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:15:46,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:15:46,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:15:46,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:15:46,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:15:46,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:15:46,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:15:46,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:15:46,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:15:46,131 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:15:46,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:15:46,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:15:46,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/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_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx 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 -> Automizer 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2023-11-21 22:15:46,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:15:46,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:15:46,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:15:46,453 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:15:46,454 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:15:46,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-21 22:15:49,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:15:50,030 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:15:50,031 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-21 22:15:50,057 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/data/bb2081d9b/4cbcadfae98d4bb199adddf6b18da359/FLAG9a07c0856 [2023-11-21 22:15:50,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/data/bb2081d9b/4cbcadfae98d4bb199adddf6b18da359 [2023-11-21 22:15:50,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:15:50,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:15:50,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:15:50,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:15:50,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:15:50,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:15:50" (1/1) ... [2023-11-21 22:15:50,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cc6484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:50, skipping insertion in model container [2023-11-21 22:15:50,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:15:50" (1/1) ... [2023-11-21 22:15:50,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:15:50,464 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_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i[949,962] [2023-11-21 22:15:50,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:15:50,874 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:15:50,889 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_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i[949,962] [2023-11-21 22:15:50,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:15:51,035 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:15:51,036 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:15:51,044 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:15:51,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51 WrapperNode [2023-11-21 22:15:51,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:15:51,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:15:51,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:15:51,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:15:51,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,149 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-11-21 22:15:51,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:15:51,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:15:51,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:15:51,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:15:51,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,178 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,198 INFO L187 HeapSplitter]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1] [2023-11-21 22:15:51,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:15:51,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:15:51,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:15:51,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:15:51,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (1/1) ... [2023-11-21 22:15:51,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:15:51,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:51,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:15:51,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:15:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:15:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:15:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:15:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 22:15:51,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 22:15:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 22:15:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:15:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:15:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:15:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 22:15:51,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 22:15:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 22:15:51,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 22:15:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 22:15:51,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 22:15:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 22:15:51,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 22:15:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:15:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:15:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:15:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 22:15:51,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 22:15:51,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 22:15:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:15:51,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:15:51,334 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 22:15:51,504 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:15:51,506 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:15:51,999 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:15:52,297 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:15:52,298 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:15:52,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:52 BoogieIcfgContainer [2023-11-21 22:15:52,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:15:52,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:15:52,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:15:52,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:15:52,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:15:50" (1/3) ... [2023-11-21 22:15:52,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa49727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:15:52, skipping insertion in model container [2023-11-21 22:15:52,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:15:51" (2/3) ... [2023-11-21 22:15:52,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa49727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:15:52, skipping insertion in model container [2023-11-21 22:15:52,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:52" (3/3) ... [2023-11-21 22:15:52,310 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-11-21 22:15:52,320 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:15:52,332 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:15:52,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 22:15:52,332 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:15:52,388 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 22:15:52,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2023-11-21 22:15:52,468 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-11-21 22:15:52,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:15:52,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-21 22:15:52,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2023-11-21 22:15:52,480 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2023-11-21 22:15:52,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:15:52,505 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=PETRI_NET, 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;@34cb8e90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:15:52,506 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 22:15:52,516 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 22:15:52,516 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-11-21 22:15:52,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 22:15:52,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:15:52,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:15:52,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:15:52,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:52,525 INFO L85 PathProgramCache]: Analyzing trace with hash -772857356, now seen corresponding path program 1 times [2023-11-21 22:15:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020487025] [2023-11-21 22:15:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:53,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:53,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020487025] [2023-11-21 22:15:53,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020487025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:53,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:53,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:15:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131534156] [2023-11-21 22:15:53,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:53,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:15:53,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:15:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:15:53,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-21 22:15:53,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-11-21 22:15:53,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:15:53,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-21 22:15:53,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:15:54,258 INFO L124 PetriNetUnfolderBase]: 2160/3536 cut-off events. [2023-11-21 22:15:54,258 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-21 22:15:54,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6665 conditions, 3536 events. 2160/3536 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 22713 event pairs, 996 based on Foata normal form. 108/3544 useless extension candidates. Maximal degree in co-relation 6653. Up to 2416 conditions per place. [2023-11-21 22:15:54,304 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 35 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2023-11-21 22:15:54,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 216 flow [2023-11-21 22:15:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:15:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 22:15:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-21 22:15:54,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.78 [2023-11-21 22:15:54,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-21 22:15:54,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-21 22:15:54,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:15:54,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-21 22:15:54,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-11-21 22:15:54,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-11-21 22:15:54,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 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-11-21 22:15:54,337 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-21 22:15:54,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 216 flow [2023-11-21 22:15:54,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 60 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 22:15:54,350 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2023-11-21 22:15:54,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-21 22:15:54,357 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-21 22:15:54,357 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2023-11-21 22:15:54,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-11-21 22:15:54,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:15:54,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:54,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:15:54,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:15:54,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1934373953, now seen corresponding path program 1 times [2023-11-21 22:15:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495805246] [2023-11-21 22:15:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:54,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495805246] [2023-11-21 22:15:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495805246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:54,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:54,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:15:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935811008] [2023-11-21 22:15:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:54,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:15:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:15:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:15:54,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-21 22:15:54,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-11-21 22:15:54,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:15:54,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-21 22:15:54,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:15:56,969 INFO L124 PetriNetUnfolderBase]: 7149/10771 cut-off events. [2023-11-21 22:15:56,970 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2023-11-21 22:15:57,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21295 conditions, 10771 events. 7149/10771 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 72612 event pairs, 869 based on Foata normal form. 320/10468 useless extension candidates. Maximal degree in co-relation 21285. Up to 5881 conditions per place. [2023-11-21 22:15:57,108 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 50 selfloop transitions, 6 changer transitions 1/73 dead transitions. [2023-11-21 22:15:57,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 282 flow [2023-11-21 22:15:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:15:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 22:15:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2023-11-21 22:15:57,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.695 [2023-11-21 22:15:57,111 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 139 transitions. [2023-11-21 22:15:57,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 139 transitions. [2023-11-21 22:15:57,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:15:57,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 139 transitions. [2023-11-21 22:15:57,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-11-21 22:15:57,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-11-21 22:15:57,116 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-11-21 22:15:57,116 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 139 transitions. [2023-11-21 22:15:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 282 flow [2023-11-21 22:15:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 22:15:57,120 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2023-11-21 22:15:57,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-21 22:15:57,121 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2023-11-21 22:15:57,121 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2023-11-21 22:15:57,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-11-21 22:15:57,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:15:57,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:57,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:15:57,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:15:57,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash -328312593, now seen corresponding path program 1 times [2023-11-21 22:15:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413013380] [2023-11-21 22:15:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:57,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:57,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:57,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413013380] [2023-11-21 22:15:57,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413013380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:57,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:57,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:15:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517976311] [2023-11-21 22:15:57,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:57,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:15:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:15:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:15:57,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-21 22:15:57,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-11-21 22:15:57,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:15:57,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-21 22:15:57,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:15:58,897 INFO L124 PetriNetUnfolderBase]: 5601/8495 cut-off events. [2023-11-21 22:15:58,897 INFO L125 PetriNetUnfolderBase]: For 2112/2112 co-relation queries the response was YES. [2023-11-21 22:15:58,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19337 conditions, 8495 events. 5601/8495 cut-off events. For 2112/2112 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 54849 event pairs, 369 based on Foata normal form. 296/8349 useless extension candidates. Maximal degree in co-relation 19325. Up to 3901 conditions per place. [2023-11-21 22:15:58,990 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 64 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2023-11-21 22:15:58,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 403 flow [2023-11-21 22:15:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:15:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 22:15:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2023-11-21 22:15:58,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.708 [2023-11-21 22:15:58,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 177 transitions. [2023-11-21 22:15:58,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 177 transitions. [2023-11-21 22:15:58,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:15:58,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 177 transitions. [2023-11-21 22:15:58,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 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-11-21 22:15:59,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-11-21 22:15:59,001 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 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-11-21 22:15:59,001 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 177 transitions. [2023-11-21 22:15:59,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 403 flow [2023-11-21 22:15:59,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 91 transitions, 392 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 22:15:59,008 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2023-11-21 22:15:59,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-11-21 22:15:59,010 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2023-11-21 22:15:59,010 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2023-11-21 22:15:59,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-11-21 22:15:59,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:15:59,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:15:59,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:15:59,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:15:59,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:15:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1540116609, now seen corresponding path program 1 times [2023-11-21 22:15:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:15:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73953542] [2023-11-21 22:15:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:15:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:15:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:15:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73953542] [2023-11-21 22:15:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73953542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:15:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:15:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:15:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055872341] [2023-11-21 22:15:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:15:59,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:15:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:15:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:15:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:15:59,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-21 22:15:59,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-11-21 22:15:59,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:15:59,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-21 22:15:59,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:00,484 INFO L124 PetriNetUnfolderBase]: 3613/5459 cut-off events. [2023-11-21 22:16:00,484 INFO L125 PetriNetUnfolderBase]: For 4185/4185 co-relation queries the response was YES. [2023-11-21 22:16:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13983 conditions, 5459 events. 3613/5459 cut-off events. For 4185/4185 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 31296 event pairs, 221 based on Foata normal form. 208/5402 useless extension candidates. Maximal degree in co-relation 13969. Up to 1501 conditions per place. [2023-11-21 22:16:00,534 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 76 selfloop transitions, 14 changer transitions 1/107 dead transitions. [2023-11-21 22:16:00,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 530 flow [2023-11-21 22:16:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:16:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 22:16:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2023-11-21 22:16:00,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.71 [2023-11-21 22:16:00,538 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions. [2023-11-21 22:16:00,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions. [2023-11-21 22:16:00,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:00,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions. [2023-11-21 22:16:00,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 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-11-21 22:16:00,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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-11-21 22:16:00,544 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 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-11-21 22:16:00,545 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 213 transitions. [2023-11-21 22:16:00,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 530 flow [2023-11-21 22:16:00,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 107 transitions, 500 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 22:16:00,577 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2023-11-21 22:16:00,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2023-11-21 22:16:00,579 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-21 22:16:00,580 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2023-11-21 22:16:00,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 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-11-21 22:16:00,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:00,581 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-21 22:16:00,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:16:00,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:00,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1744544252, now seen corresponding path program 1 times [2023-11-21 22:16:00,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:00,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781185207] [2023-11-21 22:16:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:00,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:00,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781185207] [2023-11-21 22:16:00,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781185207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:00,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:00,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:16:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476856209] [2023-11-21 22:16:00,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:00,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:16:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:16:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:16:01,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2023-11-21 22:16:01,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-11-21 22:16:01,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:01,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2023-11-21 22:16:01,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:01,755 INFO L124 PetriNetUnfolderBase]: 2425/3575 cut-off events. [2023-11-21 22:16:01,755 INFO L125 PetriNetUnfolderBase]: For 4477/4477 co-relation queries the response was YES. [2023-11-21 22:16:01,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 3575 events. 2425/3575 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18148 event pairs, 173 based on Foata normal form. 88/3491 useless extension candidates. Maximal degree in co-relation 10017. Up to 1088 conditions per place. [2023-11-21 22:16:01,791 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 68 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2023-11-21 22:16:01,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 524 flow [2023-11-21 22:16:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:16:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:16:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 229 transitions. [2023-11-21 22:16:01,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6542857142857142 [2023-11-21 22:16:01,794 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 229 transitions. [2023-11-21 22:16:01,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 229 transitions. [2023-11-21 22:16:01,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:01,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 229 transitions. [2023-11-21 22:16:01,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 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-11-21 22:16:01,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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-11-21 22:16:01,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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-11-21 22:16:01,799 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 229 transitions. [2023-11-21 22:16:01,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 524 flow [2023-11-21 22:16:01,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 478 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-21 22:16:01,831 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2023-11-21 22:16:01,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-21 22:16:01,834 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-11-21 22:16:01,834 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2023-11-21 22:16:01,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 7 states have internal predecessors, (161), 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-11-21 22:16:01,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:01,835 INFO L208 CegarLoopForPetriNet]: 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-11-21 22:16:01,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:16:01,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:01,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1885790916, now seen corresponding path program 1 times [2023-11-21 22:16:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:01,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101503094] [2023-11-21 22:16:01,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:01,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:02,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101503094] [2023-11-21 22:16:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101503094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:02,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:16:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240585857] [2023-11-21 22:16:02,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:02,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:16:02,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:02,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:16:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:16:02,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-21 22:16:02,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-11-21 22:16:02,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:02,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-21 22:16:02,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:04,051 INFO L124 PetriNetUnfolderBase]: 4947/7765 cut-off events. [2023-11-21 22:16:04,051 INFO L125 PetriNetUnfolderBase]: For 3319/3529 co-relation queries the response was YES. [2023-11-21 22:16:04,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17995 conditions, 7765 events. 4947/7765 cut-off events. For 3319/3529 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 49482 event pairs, 1086 based on Foata normal form. 16/7504 useless extension candidates. Maximal degree in co-relation 17979. Up to 3708 conditions per place. [2023-11-21 22:16:04,122 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 41 selfloop transitions, 5 changer transitions 44/117 dead transitions. [2023-11-21 22:16:04,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 117 transitions, 578 flow [2023-11-21 22:16:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:16:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:16:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2023-11-21 22:16:04,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6075 [2023-11-21 22:16:04,125 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 243 transitions. [2023-11-21 22:16:04,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 243 transitions. [2023-11-21 22:16:04,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:04,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 243 transitions. [2023-11-21 22:16:04,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 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-11-21 22:16:04,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-11-21 22:16:04,129 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-11-21 22:16:04,129 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 8 states and 243 transitions. [2023-11-21 22:16:04,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 117 transitions, 578 flow [2023-11-21 22:16:04,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 472 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-21 22:16:04,202 INFO L231 Difference]: Finished difference. Result has 70 places, 58 transitions, 195 flow [2023-11-21 22:16:04,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=195, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2023-11-21 22:16:04,203 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-21 22:16:04,204 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 195 flow [2023-11-21 22:16:04,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-11-21 22:16:04,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:04,205 INFO L208 CegarLoopForPetriNet]: 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-11-21 22:16:04,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:16:04,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:04,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash -304022642, now seen corresponding path program 2 times [2023-11-21 22:16:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260300448] [2023-11-21 22:16:04,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260300448] [2023-11-21 22:16:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260300448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:05,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:16:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288837867] [2023-11-21 22:16:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:05,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:16:05,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:05,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:16:05,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:16:05,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-21 22:16:05,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-11-21 22:16:05,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:05,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-21 22:16:05,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:06,648 INFO L124 PetriNetUnfolderBase]: 4553/7446 cut-off events. [2023-11-21 22:16:06,648 INFO L125 PetriNetUnfolderBase]: For 2395/2404 co-relation queries the response was YES. [2023-11-21 22:16:06,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17004 conditions, 7446 events. 4553/7446 cut-off events. For 2395/2404 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 50409 event pairs, 766 based on Foata normal form. 18/7138 useless extension candidates. Maximal degree in co-relation 16987. Up to 2815 conditions per place. [2023-11-21 22:16:06,716 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 39 selfloop transitions, 4 changer transitions 32/102 dead transitions. [2023-11-21 22:16:06,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 469 flow [2023-11-21 22:16:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:16:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:16:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 228 transitions. [2023-11-21 22:16:06,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.57 [2023-11-21 22:16:06,719 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 228 transitions. [2023-11-21 22:16:06,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 228 transitions. [2023-11-21 22:16:06,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:06,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 228 transitions. [2023-11-21 22:16:06,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 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-11-21 22:16:06,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-11-21 22:16:06,723 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-11-21 22:16:06,724 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 195 flow. Second operand 8 states and 228 transitions. [2023-11-21 22:16:06,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 469 flow [2023-11-21 22:16:06,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 459 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-21 22:16:06,729 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 201 flow [2023-11-21 22:16:06,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=201, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-11-21 22:16:06,731 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2023-11-21 22:16:06,731 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 201 flow [2023-11-21 22:16:06,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-11-21 22:16:06,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:06,732 INFO L208 CegarLoopForPetriNet]: 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-11-21 22:16:06,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:16:06,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:06,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -991559106, now seen corresponding path program 3 times [2023-11-21 22:16:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372611147] [2023-11-21 22:16:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:06,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372611147] [2023-11-21 22:16:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372611147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:09,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-21 22:16:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467077298] [2023-11-21 22:16:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:09,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-21 22:16:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-21 22:16:09,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-21 22:16:09,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-21 22:16:09,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 201 flow. Second operand has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 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-11-21 22:16:09,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:09,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-21 22:16:09,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:11,014 INFO L124 PetriNetUnfolderBase]: 6600/10560 cut-off events. [2023-11-21 22:16:11,015 INFO L125 PetriNetUnfolderBase]: For 2508/2607 co-relation queries the response was YES. [2023-11-21 22:16:11,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23698 conditions, 10560 events. 6600/10560 cut-off events. For 2508/2607 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 73096 event pairs, 1226 based on Foata normal form. 18/10033 useless extension candidates. Maximal degree in co-relation 23678. Up to 2576 conditions per place. [2023-11-21 22:16:11,103 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 89 selfloop transitions, 17 changer transitions 15/148 dead transitions. [2023-11-21 22:16:11,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 148 transitions, 713 flow [2023-11-21 22:16:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:16:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 22:16:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 311 transitions. [2023-11-21 22:16:11,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.622 [2023-11-21 22:16:11,106 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 311 transitions. [2023-11-21 22:16:11,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 311 transitions. [2023-11-21 22:16:11,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:11,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 311 transitions. [2023-11-21 22:16:11,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 31.1) internal successors, (311), 10 states have internal predecessors, (311), 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-11-21 22:16:11,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 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-11-21 22:16:11,112 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 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-11-21 22:16:11,112 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 201 flow. Second operand 10 states and 311 transitions. [2023-11-21 22:16:11,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 148 transitions, 713 flow [2023-11-21 22:16:11,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 148 transitions, 694 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-21 22:16:11,119 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 328 flow [2023-11-21 22:16:11,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=328, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2023-11-21 22:16:11,122 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2023-11-21 22:16:11,123 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 328 flow [2023-11-21 22:16:11,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 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-11-21 22:16:11,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:11,124 INFO L208 CegarLoopForPetriNet]: 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-11-21 22:16:11,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:16:11,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:11,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2102123502, now seen corresponding path program 4 times [2023-11-21 22:16:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186057554] [2023-11-21 22:16:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186057554] [2023-11-21 22:16:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186057554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 22:16:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676234581] [2023-11-21 22:16:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:11,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 22:16:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:11,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:16:11,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:16:11,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2023-11-21 22:16:11,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-11-21 22:16:11,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:11,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2023-11-21 22:16:11,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:14,190 INFO L124 PetriNetUnfolderBase]: 10178/16857 cut-off events. [2023-11-21 22:16:14,190 INFO L125 PetriNetUnfolderBase]: For 13534/13790 co-relation queries the response was YES. [2023-11-21 22:16:14,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43769 conditions, 16857 events. 10178/16857 cut-off events. For 13534/13790 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 130442 event pairs, 3342 based on Foata normal form. 42/16041 useless extension candidates. Maximal degree in co-relation 43744. Up to 6572 conditions per place. [2023-11-21 22:16:14,299 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 40 selfloop transitions, 3 changer transitions 58/130 dead transitions. [2023-11-21 22:16:14,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 130 transitions, 766 flow [2023-11-21 22:16:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 22:16:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 22:16:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 231 transitions. [2023-11-21 22:16:14,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5775 [2023-11-21 22:16:14,302 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 231 transitions. [2023-11-21 22:16:14,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 231 transitions. [2023-11-21 22:16:14,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:14,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 231 transitions. [2023-11-21 22:16:14,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-11-21 22:16:14,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-11-21 22:16:14,305 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 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-11-21 22:16:14,305 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 328 flow. Second operand 8 states and 231 transitions. [2023-11-21 22:16:14,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 130 transitions, 766 flow [2023-11-21 22:16:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 130 transitions, 749 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-21 22:16:14,359 INFO L231 Difference]: Finished difference. Result has 88 places, 62 transitions, 263 flow [2023-11-21 22:16:14,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=263, PETRI_PLACES=88, PETRI_TRANSITIONS=62} [2023-11-21 22:16:14,360 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-11-21 22:16:14,361 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 62 transitions, 263 flow [2023-11-21 22:16:14,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-11-21 22:16:14,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:14,361 INFO L208 CegarLoopForPetriNet]: 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-11-21 22:16:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:16:14,362 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:14,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1753202188, now seen corresponding path program 5 times [2023-11-21 22:16:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012495759] [2023-11-21 22:16:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:16:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:16:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:16:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012495759] [2023-11-21 22:16:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012495759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:16:16,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:16:16,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 22:16:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55932533] [2023-11-21 22:16:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:16:16,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-21 22:16:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:16:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 22:16:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-21 22:16:16,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-21 22:16:16,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 62 transitions, 263 flow. Second operand has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 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-11-21 22:16:16,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 22:16:16,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-21 22:16:16,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 22:16:17,904 INFO L124 PetriNetUnfolderBase]: 4765/8257 cut-off events. [2023-11-21 22:16:17,904 INFO L125 PetriNetUnfolderBase]: For 3418/3552 co-relation queries the response was YES. [2023-11-21 22:16:17,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19540 conditions, 8257 events. 4765/8257 cut-off events. For 3418/3552 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 60133 event pairs, 1802 based on Foata normal form. 67/7598 useless extension candidates. Maximal degree in co-relation 19512. Up to 2841 conditions per place. [2023-11-21 22:16:17,979 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 43 selfloop transitions, 5 changer transitions 17/96 dead transitions. [2023-11-21 22:16:17,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 96 transitions, 487 flow [2023-11-21 22:16:17,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:16:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 22:16:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2023-11-21 22:16:17,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2023-11-21 22:16:17,983 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 222 transitions. [2023-11-21 22:16:17,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 222 transitions. [2023-11-21 22:16:17,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:16:17,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 222 transitions. [2023-11-21 22:16:17,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 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-11-21 22:16:17,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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-11-21 22:16:17,987 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 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-11-21 22:16:17,987 INFO L175 Difference]: Start difference. First operand has 88 places, 62 transitions, 263 flow. Second operand 7 states and 222 transitions. [2023-11-21 22:16:17,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 96 transitions, 487 flow [2023-11-21 22:16:18,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 461 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-11-21 22:16:18,015 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 257 flow [2023-11-21 22:16:18,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2023-11-21 22:16:18,017 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-21 22:16:18,017 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 257 flow [2023-11-21 22:16:18,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.666666666666668) internal successors, (296), 12 states have internal predecessors, (296), 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-11-21 22:16:18,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 22:16:18,018 INFO L208 CegarLoopForPetriNet]: 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-11-21 22:16:18,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:16:18,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-21 22:16:18,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:16:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1780771134, now seen corresponding path program 6 times [2023-11-21 22:16:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:16:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813214235] [2023-11-21 22:16:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:16:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:16:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:16:18,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:16:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:16:18,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:16:18,252 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:16:18,253 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-21 22:16:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-21 22:16:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-21 22:16:18,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-21 22:16:18,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-21 22:16:18,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-21 22:16:18,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-21 22:16:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:16:18,258 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2023-11-21 22:16:18,265 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 22:16:18,265 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:16:18,353 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-21 22:16:18,356 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:16:18,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:16:18,358 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 22:16:18,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:16:18 BasicIcfg [2023-11-21 22:16:18,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:16:18,424 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:16:18,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:16:18,424 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:16:18,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:15:52" (3/4) ... [2023-11-21 22:16:18,425 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-21 22:16:18,471 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-21 22:16:18,476 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 22:16:18,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 22:16:18,478 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 22:16:18,590 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:16:18,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:16:18,591 INFO L158 Benchmark]: Toolchain (without parser) took 28513.20ms. Allocated memory was 146.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 116.2MB in the beginning and 1.1GB in the end (delta: -990.7MB). Peak memory consumption was 832.1MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,591 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory was 73.6MB in the beginning and 73.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:16:18,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 966.50ms. Allocated memory is still 146.8MB. Free memory was 116.2MB in the beginning and 91.2MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.15ms. Allocated memory is still 146.8MB. Free memory was 91.2MB in the beginning and 88.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,593 INFO L158 Benchmark]: Boogie Preprocessor took 97.64ms. Allocated memory is still 146.8MB. Free memory was 88.3MB in the beginning and 84.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,593 INFO L158 Benchmark]: RCFGBuilder took 1051.30ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 78.9MB in the end (delta: 5.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,594 INFO L158 Benchmark]: TraceAbstraction took 26119.98ms. Allocated memory was 146.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 78.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 773.7MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,594 INFO L158 Benchmark]: Witness Printer took 166.77ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-21 22:16:18,597 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.29ms. Allocated memory is still 113.2MB. Free memory was 73.6MB in the beginning and 73.5MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 966.50ms. Allocated memory is still 146.8MB. Free memory was 116.2MB in the beginning and 91.2MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.15ms. Allocated memory is still 146.8MB. Free memory was 91.2MB in the beginning and 88.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.64ms. Allocated memory is still 146.8MB. Free memory was 88.3MB in the beginning and 84.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1051.30ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 78.9MB in the end (delta: 5.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26119.98ms. Allocated memory was 146.8MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 78.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 773.7MB. Max. memory is 16.1GB. * Witness Printer took 166.77ms. Allocated memory is still 2.0GB. Free memory was 1.1GB in the beginning and 1.1GB 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~pre3 could not be translated - 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 The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - 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 The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, t994={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - 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: 863]: 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: 865]: 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: 859]: 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: 861]: 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. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 861 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 788 mSDsluCounter, 580 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 464 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1922 IncrementalHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 116 mSDtfsCounter, 1922 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=8, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 2440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-21 22:16:18,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42d1e98f-37c3-4992-bdea-1fdc2b8acb39/bin/uautomizer-verify-bycVGegfSx/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