./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme --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 a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 12:03:28,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 12:03:28,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 12:03:28,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 12:03:28,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 12:03:28,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 12:03:28,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 12:03:28,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 12:03:28,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 12:03:28,478 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 12:03:28,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 12:03:28,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 12:03:28,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 12:03:28,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 12:03:28,482 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 12:03:28,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 12:03:28,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 12:03:28,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 12:03:28,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 12:03:28,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 12:03:28,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 12:03:28,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 12:03:28,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 12:03:28,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 12:03:28,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 12:03:28,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 12:03:28,488 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 12:03:28,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 12:03:28,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 12:03:28,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 12:03:28,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 12:03:28,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:28,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 12:03:28,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 12:03:28,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 12:03:28,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 12:03:28,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 12:03:28,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 12:03:28,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 12:03:28,494 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 12:03:28,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 12:03:28,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 12:03:28,495 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_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/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_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme 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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2023-11-26 12:03:28,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 12:03:28,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 12:03:28,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 12:03:28,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 12:03:28,763 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 12:03:28,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-26 12:03:31,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 12:03:32,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 12:03:32,197 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-26 12:03:32,216 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/data/a120633c9/66b45d01d850484480e91ded4accb9e7/FLAGf49fc8ee7 [2023-11-26 12:03:32,235 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/data/a120633c9/66b45d01d850484480e91ded4accb9e7 [2023-11-26 12:03:32,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 12:03:32,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 12:03:32,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 12:03:32,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 12:03:32,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 12:03:32,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:32,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebf76dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32, skipping insertion in model container [2023-11-26 12:03:32,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:32,318 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 12:03:32,497 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_1a882658-f162-44fb-b140-0419ab7470f8/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2023-11-26 12:03:32,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:03:32,740 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 12:03:32,758 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_1a882658-f162-44fb-b140-0419ab7470f8/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2023-11-26 12:03:32,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 12:03:32,877 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:03:32,877 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 12:03:32,886 INFO L206 MainTranslator]: Completed translation [2023-11-26 12:03:32,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32 WrapperNode [2023-11-26 12:03:32,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 12:03:32,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 12:03:32,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 12:03:32,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 12:03:32,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:32,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:32,992 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-26 12:03:32,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 12:03:32,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 12:03:32,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 12:03:32,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 12:03:33,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,062 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 12:03:33,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 12:03:33,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 12:03:33,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 12:03:33,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 12:03:33,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (1/1) ... [2023-11-26 12:03:33,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 12:03:33,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 12:03:33,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 12:03:33,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a882658-f162-44fb-b140-0419ab7470f8/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 12:03:33,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 12:03:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 12:03:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 12:03:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 12:03:33,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 12:03:33,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 12:03:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 12:03:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 12:03:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 12:03:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 12:03:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 12:03:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 12:03:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 12:03:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 12:03:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 12:03:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 12:03:33,191 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 12:03:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 12:03:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 12:03:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 12:03:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 12:03:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 12:03:33,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 12:03:33,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 12:03:33,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 12:03:33,196 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 12:03:33,394 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 12:03:33,398 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 12:03:33,856 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 12:03:34,082 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 12:03:34,083 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 12:03:34,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:34 BoogieIcfgContainer [2023-11-26 12:03:34,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 12:03:34,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 12:03:34,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 12:03:34,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 12:03:34,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:03:32" (1/3) ... [2023-11-26 12:03:34,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6465be3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:03:34, skipping insertion in model container [2023-11-26 12:03:34,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:03:32" (2/3) ... [2023-11-26 12:03:34,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6465be3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:03:34, skipping insertion in model container [2023-11-26 12:03:34,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:03:34" (3/3) ... [2023-11-26 12:03:34,093 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-11-26 12:03:34,102 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 12:03:34,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 12:03:34,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-26 12:03:34,114 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 12:03:34,177 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 12:03:34,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 48 transitions, 112 flow [2023-11-26 12:03:34,278 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2023-11-26 12:03:34,278 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:03:34,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2023-11-26 12:03:34,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 48 transitions, 112 flow [2023-11-26 12:03:34,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 44 transitions, 100 flow [2023-11-26 12:03:34,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 12:03:34,328 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;@5aa4f20c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 12:03:34,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-26 12:03:34,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 12:03:34,351 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2023-11-26 12:03:34,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:03:34,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:34,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:34,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:34,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1548599738, now seen corresponding path program 1 times [2023-11-26 12:03:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779466218] [2023-11-26 12:03:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:34,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:35,056 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-26 12:03:35,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:35,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779466218] [2023-11-26 12:03:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779466218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:35,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:35,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 12:03:35,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882985166] [2023-11-26 12:03:35,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:35,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 12:03:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 12:03:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 12:03:35,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 48 [2023-11-26 12:03:35,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-26 12:03:35,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:35,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 48 [2023-11-26 12:03:35,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:35,590 INFO L124 PetriNetUnfolderBase]: 815/1447 cut-off events. [2023-11-26 12:03:35,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 12:03:35,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1447 events. 815/1447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9955 event pairs, 179 based on Foata normal form. 48/1444 useless extension candidates. Maximal degree in co-relation 2667. Up to 889 conditions per place. [2023-11-26 12:03:35,615 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 27 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-26 12:03:35,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 178 flow [2023-11-26 12:03:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 12:03:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 12:03:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-11-26 12:03:35,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2023-11-26 12:03:35,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-11-26 12:03:35,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-11-26 12:03:35,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:35,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-11-26 12:03:35,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-26 12:03:35,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-26 12:03:35,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-26 12:03:35,649 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 109 transitions. [2023-11-26 12:03:35,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 178 flow [2023-11-26 12:03:35,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 12:03:35,657 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 94 flow [2023-11-26 12:03:35,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-26 12:03:35,667 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2023-11-26 12:03:35,667 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 94 flow [2023-11-26 12:03:35,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-26 12:03:35,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:35,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:35,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 12:03:35,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:35,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:35,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1653969379, now seen corresponding path program 1 times [2023-11-26 12:03:35,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804965559] [2023-11-26 12:03:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:35,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:36,226 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-26 12:03:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804965559] [2023-11-26 12:03:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804965559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:36,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:36,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:03:36,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769955485] [2023-11-26 12:03:36,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:36,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:36,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:36,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:36,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:36,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2023-11-26 12:03:36,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-26 12:03:36,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:36,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2023-11-26 12:03:36,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:37,382 INFO L124 PetriNetUnfolderBase]: 3036/5323 cut-off events. [2023-11-26 12:03:37,382 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2023-11-26 12:03:37,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9947 conditions, 5323 events. 3036/5323 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 40009 event pairs, 533 based on Foata normal form. 0/5034 useless extension candidates. Maximal degree in co-relation 9937. Up to 2665 conditions per place. [2023-11-26 12:03:37,433 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 36 selfloop transitions, 3 changer transitions 47/103 dead transitions. [2023-11-26 12:03:37,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 408 flow [2023-11-26 12:03:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:03:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:03:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 256 transitions. [2023-11-26 12:03:37,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-26 12:03:37,446 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 256 transitions. [2023-11-26 12:03:37,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 256 transitions. [2023-11-26 12:03:37,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:37,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 256 transitions. [2023-11-26 12:03:37,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 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-26 12:03:37,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:03:37,458 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:03:37,459 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 8 states and 256 transitions. [2023-11-26 12:03:37,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 408 flow [2023-11-26 12:03:37,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 103 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:37,470 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 123 flow [2023-11-26 12:03:37,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=123, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-11-26 12:03:37,473 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2023-11-26 12:03:37,473 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 123 flow [2023-11-26 12:03:37,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-26 12:03:37,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:37,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 12:03:37,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 12:03:37,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:37,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash 368961950, now seen corresponding path program 1 times [2023-11-26 12:03:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:37,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053948903] [2023-11-26 12:03:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:37,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:38,920 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-26 12:03:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053948903] [2023-11-26 12:03:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053948903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:38,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:03:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068927897] [2023-11-26 12:03:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:38,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:03:38,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:38,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:03:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:03:38,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:03:38,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-26 12:03:38,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:38,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:03:38,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:41,810 INFO L124 PetriNetUnfolderBase]: 9051/14097 cut-off events. [2023-11-26 12:03:41,810 INFO L125 PetriNetUnfolderBase]: For 7936/7936 co-relation queries the response was YES. [2023-11-26 12:03:41,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33128 conditions, 14097 events. 9051/14097 cut-off events. For 7936/7936 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 104089 event pairs, 968 based on Foata normal form. 372/14435 useless extension candidates. Maximal degree in co-relation 33113. Up to 6986 conditions per place. [2023-11-26 12:03:41,960 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 50 selfloop transitions, 13 changer transitions 67/144 dead transitions. [2023-11-26 12:03:41,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 144 transitions, 723 flow [2023-11-26 12:03:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 12:03:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 12:03:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 307 transitions. [2023-11-26 12:03:41,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6395833333333333 [2023-11-26 12:03:41,965 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 307 transitions. [2023-11-26 12:03:41,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 307 transitions. [2023-11-26 12:03:41,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:41,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 307 transitions. [2023-11-26 12:03:41,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 30.7) internal successors, (307), 10 states have internal predecessors, (307), 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-26 12:03:41,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 48.0) internal successors, (528), 11 states have internal predecessors, (528), 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-26 12:03:41,969 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 48.0) internal successors, (528), 11 states have internal predecessors, (528), 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-26 12:03:41,969 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 123 flow. Second operand 10 states and 307 transitions. [2023-11-26 12:03:41,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 144 transitions, 723 flow [2023-11-26 12:03:42,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 144 transitions, 702 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-26 12:03:42,152 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 274 flow [2023-11-26 12:03:42,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2023-11-26 12:03:42,153 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2023-11-26 12:03:42,154 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 274 flow [2023-11-26 12:03:42,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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-26 12:03:42,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:42,154 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] [2023-11-26 12:03:42,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 12:03:42,155 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:42,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1641440480, now seen corresponding path program 1 times [2023-11-26 12:03:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:42,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666845621] [2023-11-26 12:03:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:43,187 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-26 12:03:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666845621] [2023-11-26 12:03:43,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666845621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:43,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:43,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:03:43,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556505338] [2023-11-26 12:03:43,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:43,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:03:43,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:03:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:03:43,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2023-11-26 12:03:43,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-26 12:03:43,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:43,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2023-11-26 12:03:43,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:45,442 INFO L124 PetriNetUnfolderBase]: 6177/10619 cut-off events. [2023-11-26 12:03:45,442 INFO L125 PetriNetUnfolderBase]: For 23258/23557 co-relation queries the response was YES. [2023-11-26 12:03:45,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34915 conditions, 10619 events. 6177/10619 cut-off events. For 23258/23557 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 86789 event pairs, 2013 based on Foata normal form. 278/10391 useless extension candidates. Maximal degree in co-relation 34892. Up to 5872 conditions per place. [2023-11-26 12:03:45,587 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 38 selfloop transitions, 6 changer transitions 31/101 dead transitions. [2023-11-26 12:03:45,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 650 flow [2023-11-26 12:03:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:03:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:03:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 241 transitions. [2023-11-26 12:03:45,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6276041666666666 [2023-11-26 12:03:45,590 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 241 transitions. [2023-11-26 12:03:45,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 241 transitions. [2023-11-26 12:03:45,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:45,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 241 transitions. [2023-11-26 12:03:45,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-26 12:03:45,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:03:45,594 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:03:45,594 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 274 flow. Second operand 8 states and 241 transitions. [2023-11-26 12:03:45,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 650 flow [2023-11-26 12:03:45,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 638 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-26 12:03:45,702 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 332 flow [2023-11-26 12:03:45,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=332, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-11-26 12:03:45,704 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places. [2023-11-26 12:03:45,705 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 332 flow [2023-11-26 12:03:45,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-26 12:03:45,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:45,706 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-26 12:03:45,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 12:03:45,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:45,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 175374135, now seen corresponding path program 1 times [2023-11-26 12:03:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034631366] [2023-11-26 12:03:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:46,405 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-26 12:03:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034631366] [2023-11-26 12:03:46,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034631366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:46,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:46,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:03:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030576892] [2023-11-26 12:03:46,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:46,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:03:46,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:46,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:03:46,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:03:46,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2023-11-26 12:03:46,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-26 12:03:46,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:46,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2023-11-26 12:03:46,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:48,808 INFO L124 PetriNetUnfolderBase]: 6730/11205 cut-off events. [2023-11-26 12:03:48,808 INFO L125 PetriNetUnfolderBase]: For 38523/39809 co-relation queries the response was YES. [2023-11-26 12:03:48,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41056 conditions, 11205 events. 6730/11205 cut-off events. For 38523/39809 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 89203 event pairs, 1719 based on Foata normal form. 304/10793 useless extension candidates. Maximal degree in co-relation 41028. Up to 5271 conditions per place. [2023-11-26 12:03:48,921 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 48 selfloop transitions, 15 changer transitions 56/145 dead transitions. [2023-11-26 12:03:48,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 145 transitions, 1070 flow [2023-11-26 12:03:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 12:03:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-26 12:03:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 380 transitions. [2023-11-26 12:03:48,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089743589743589 [2023-11-26 12:03:48,925 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 380 transitions. [2023-11-26 12:03:48,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 380 transitions. [2023-11-26 12:03:48,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:48,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 380 transitions. [2023-11-26 12:03:48,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 29.23076923076923) internal successors, (380), 13 states have internal predecessors, (380), 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-26 12:03:48,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 48.0) internal successors, (672), 14 states have internal predecessors, (672), 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-26 12:03:48,930 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 48.0) internal successors, (672), 14 states have internal predecessors, (672), 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-26 12:03:48,930 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 332 flow. Second operand 13 states and 380 transitions. [2023-11-26 12:03:48,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 145 transitions, 1070 flow [2023-11-26 12:03:49,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 145 transitions, 1040 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-26 12:03:49,019 INFO L231 Difference]: Finished difference. Result has 89 places, 67 transitions, 471 flow [2023-11-26 12:03:49,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=471, PETRI_PLACES=89, PETRI_TRANSITIONS=67} [2023-11-26 12:03:49,022 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 33 predicate places. [2023-11-26 12:03:49,022 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 67 transitions, 471 flow [2023-11-26 12:03:49,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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-26 12:03:49,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:49,023 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] [2023-11-26 12:03:49,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 12:03:49,023 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:49,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash -933811140, now seen corresponding path program 1 times [2023-11-26 12:03:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:49,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027801161] [2023-11-26 12:03:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:49,843 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-26 12:03:49,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027801161] [2023-11-26 12:03:49,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027801161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:49,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:49,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:03:49,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972316692] [2023-11-26 12:03:49,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:49,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 12:03:49,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:49,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 12:03:49,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-26 12:03:49,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 48 [2023-11-26 12:03:49,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 67 transitions, 471 flow. Second operand has 8 states, 8 states have (on average 24.0) internal successors, (192), 8 states have internal predecessors, (192), 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-26 12:03:49,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:49,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 48 [2023-11-26 12:03:49,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:52,312 INFO L124 PetriNetUnfolderBase]: 6032/10065 cut-off events. [2023-11-26 12:03:52,313 INFO L125 PetriNetUnfolderBase]: For 60816/62102 co-relation queries the response was YES. [2023-11-26 12:03:52,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41959 conditions, 10065 events. 6032/10065 cut-off events. For 60816/62102 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 78644 event pairs, 1749 based on Foata normal form. 185/9572 useless extension candidates. Maximal degree in co-relation 41923. Up to 5432 conditions per place. [2023-11-26 12:03:52,432 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 47 selfloop transitions, 9 changer transitions 25/107 dead transitions. [2023-11-26 12:03:52,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 107 transitions, 867 flow [2023-11-26 12:03:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:03:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:03:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 237 transitions. [2023-11-26 12:03:52,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171875 [2023-11-26 12:03:52,435 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 237 transitions. [2023-11-26 12:03:52,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 237 transitions. [2023-11-26 12:03:52,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:52,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 237 transitions. [2023-11-26 12:03:52,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 29.625) internal successors, (237), 8 states have internal predecessors, (237), 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-26 12:03:52,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:03:52,438 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:03:52,439 INFO L175 Difference]: Start difference. First operand has 89 places, 67 transitions, 471 flow. Second operand 8 states and 237 transitions. [2023-11-26 12:03:52,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 107 transitions, 867 flow [2023-11-26 12:03:52,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 787 flow, removed 40 selfloop flow, removed 10 redundant places. [2023-11-26 12:03:52,660 INFO L231 Difference]: Finished difference. Result has 83 places, 67 transitions, 462 flow [2023-11-26 12:03:52,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=462, PETRI_PLACES=83, PETRI_TRANSITIONS=67} [2023-11-26 12:03:52,663 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 27 predicate places. [2023-11-26 12:03:52,664 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 67 transitions, 462 flow [2023-11-26 12:03:52,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.0) internal successors, (192), 8 states have internal predecessors, (192), 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-26 12:03:52,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:52,664 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] [2023-11-26 12:03:52,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 12:03:52,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:52,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:52,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1507257183, now seen corresponding path program 1 times [2023-11-26 12:03:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248840546] [2023-11-26 12:03:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:52,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:52,854 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-26 12:03:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:52,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248840546] [2023-11-26 12:03:52,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248840546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:52,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:52,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 12:03:52,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777591542] [2023-11-26 12:03:52,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:52,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 12:03:52,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:52,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 12:03:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 12:03:52,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-26 12:03:52,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 67 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-26 12:03:52,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:52,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-26 12:03:52,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:03:56,758 INFO L124 PetriNetUnfolderBase]: 16492/24553 cut-off events. [2023-11-26 12:03:56,759 INFO L125 PetriNetUnfolderBase]: For 100295/108353 co-relation queries the response was YES. [2023-11-26 12:03:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87729 conditions, 24553 events. 16492/24553 cut-off events. For 100295/108353 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 178334 event pairs, 3484 based on Foata normal form. 952/24210 useless extension candidates. Maximal degree in co-relation 87696. Up to 12592 conditions per place. [2023-11-26 12:03:57,042 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 90 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2023-11-26 12:03:57,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 1074 flow [2023-11-26 12:03:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 12:03:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 12:03:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2023-11-26 12:03:57,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2023-11-26 12:03:57,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 133 transitions. [2023-11-26 12:03:57,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 133 transitions. [2023-11-26 12:03:57,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:03:57,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 133 transitions. [2023-11-26 12:03:57,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-26 12:03:57,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-26 12:03:57,049 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 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-26 12:03:57,049 INFO L175 Difference]: Start difference. First operand has 83 places, 67 transitions, 462 flow. Second operand 4 states and 133 transitions. [2023-11-26 12:03:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 1074 flow [2023-11-26 12:03:57,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 121 transitions, 1020 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-11-26 12:03:57,175 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 482 flow [2023-11-26 12:03:57,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-11-26 12:03:57,177 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2023-11-26 12:03:57,177 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 482 flow [2023-11-26 12:03:57,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-26 12:03:57,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:03:57,178 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] [2023-11-26 12:03:57,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 12:03:57,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:03:57,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:03:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1590270012, now seen corresponding path program 1 times [2023-11-26 12:03:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:03:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915322466] [2023-11-26 12:03:57,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:03:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:03:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:03:57,381 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-26 12:03:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:03:57,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915322466] [2023-11-26 12:03:57,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915322466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:03:57,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:03:57,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 12:03:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441488138] [2023-11-26 12:03:57,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:03:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 12:03:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:03:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 12:03:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 12:03:57,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-26 12:03:57,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 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-26 12:03:57,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:03:57,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-26 12:03:57,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:00,510 INFO L124 PetriNetUnfolderBase]: 13650/20489 cut-off events. [2023-11-26 12:04:00,510 INFO L125 PetriNetUnfolderBase]: For 75347/85265 co-relation queries the response was YES. [2023-11-26 12:04:00,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75105 conditions, 20489 events. 13650/20489 cut-off events. For 75347/85265 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 145205 event pairs, 1849 based on Foata normal form. 996/20384 useless extension candidates. Maximal degree in co-relation 75074. Up to 7619 conditions per place. [2023-11-26 12:04:00,676 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 117 selfloop transitions, 10 changer transitions 0/152 dead transitions. [2023-11-26 12:04:00,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 152 transitions, 1342 flow [2023-11-26 12:04:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 12:04:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 12:04:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2023-11-26 12:04:00,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2023-11-26 12:04:00,678 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 170 transitions. [2023-11-26 12:04:00,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 170 transitions. [2023-11-26 12:04:00,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:00,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 170 transitions. [2023-11-26 12:04:00,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-26 12:04:00,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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-26 12:04:00,681 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 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-26 12:04:00,681 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 482 flow. Second operand 5 states and 170 transitions. [2023-11-26 12:04:00,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 152 transitions, 1342 flow [2023-11-26 12:04:00,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 1339 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 12:04:00,733 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 547 flow [2023-11-26 12:04:00,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=547, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2023-11-26 12:04:00,736 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places. [2023-11-26 12:04:00,736 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 547 flow [2023-11-26 12:04:00,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 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-26 12:04:00,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:00,737 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-26 12:04:00,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 12:04:00,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:00,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:00,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1244821549, now seen corresponding path program 1 times [2023-11-26 12:04:00,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:00,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577835334] [2023-11-26 12:04:00,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:00,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:01,605 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-26 12:04:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577835334] [2023-11-26 12:04:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577835334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954245733] [2023-11-26 12:04:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:01,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:01,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2023-11-26 12:04:01,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-26 12:04:01,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:01,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2023-11-26 12:04:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:05,097 INFO L124 PetriNetUnfolderBase]: 13816/22388 cut-off events. [2023-11-26 12:04:05,097 INFO L125 PetriNetUnfolderBase]: For 66179/73968 co-relation queries the response was YES. [2023-11-26 12:04:05,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84991 conditions, 22388 events. 13816/22388 cut-off events. For 66179/73968 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 177932 event pairs, 4906 based on Foata normal form. 662/21283 useless extension candidates. Maximal degree in co-relation 84957. Up to 9252 conditions per place. [2023-11-26 12:04:05,254 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 93 selfloop transitions, 16 changer transitions 18/154 dead transitions. [2023-11-26 12:04:05,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 154 transitions, 1325 flow [2023-11-26 12:04:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:04:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:04:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 246 transitions. [2023-11-26 12:04:05,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.640625 [2023-11-26 12:04:05,256 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 246 transitions. [2023-11-26 12:04:05,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 246 transitions. [2023-11-26 12:04:05,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:05,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 246 transitions. [2023-11-26 12:04:05,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 30.75) internal successors, (246), 8 states have internal predecessors, (246), 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-26 12:04:05,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:04:05,259 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:04:05,259 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 547 flow. Second operand 8 states and 246 transitions. [2023-11-26 12:04:05,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 154 transitions, 1325 flow [2023-11-26 12:04:05,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 154 transitions, 1302 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-26 12:04:05,317 INFO L231 Difference]: Finished difference. Result has 93 places, 84 transitions, 674 flow [2023-11-26 12:04:05,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=674, PETRI_PLACES=93, PETRI_TRANSITIONS=84} [2023-11-26 12:04:05,319 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2023-11-26 12:04:05,319 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 84 transitions, 674 flow [2023-11-26 12:04:05,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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-26 12:04:05,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:05,319 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-26 12:04:05,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 12:04:05,320 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:05,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash -488161435, now seen corresponding path program 1 times [2023-11-26 12:04:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234743319] [2023-11-26 12:04:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:05,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:05,725 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-26 12:04:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:05,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234743319] [2023-11-26 12:04:05,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234743319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:05,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:05,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 12:04:05,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619967929] [2023-11-26 12:04:05,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:05,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 12:04:05,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 12:04:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 12:04:05,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-26 12:04:05,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 84 transitions, 674 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-26 12:04:05,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:05,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-26 12:04:05,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:09,210 INFO L124 PetriNetUnfolderBase]: 15183/22577 cut-off events. [2023-11-26 12:04:09,211 INFO L125 PetriNetUnfolderBase]: For 105358/118035 co-relation queries the response was YES. [2023-11-26 12:04:09,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88455 conditions, 22577 events. 15183/22577 cut-off events. For 105358/118035 co-relation queries the response was YES. Maximal size of possible extension queue 1282. Compared 159218 event pairs, 1171 based on Foata normal form. 1152/22604 useless extension candidates. Maximal degree in co-relation 88415. Up to 7465 conditions per place. [2023-11-26 12:04:09,353 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 113 selfloop transitions, 14 changer transitions 13/165 dead transitions. [2023-11-26 12:04:09,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 1549 flow [2023-11-26 12:04:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 12:04:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 12:04:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2023-11-26 12:04:09,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7118055555555556 [2023-11-26 12:04:09,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 205 transitions. [2023-11-26 12:04:09,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 205 transitions. [2023-11-26 12:04:09,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:09,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 205 transitions. [2023-11-26 12:04:09,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 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-26 12:04:09,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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-26 12:04:09,358 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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-26 12:04:09,359 INFO L175 Difference]: Start difference. First operand has 93 places, 84 transitions, 674 flow. Second operand 6 states and 205 transitions. [2023-11-26 12:04:09,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 165 transitions, 1549 flow [2023-11-26 12:04:09,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 165 transitions, 1508 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-11-26 12:04:09,463 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 661 flow [2023-11-26 12:04:09,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2023-11-26 12:04:09,466 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2023-11-26 12:04:09,467 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 661 flow [2023-11-26 12:04:09,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 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-26 12:04:09,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:09,468 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-26 12:04:09,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 12:04:09,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:09,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash 22591331, now seen corresponding path program 1 times [2023-11-26 12:04:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321608841] [2023-11-26 12:04:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:10,384 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-26 12:04:10,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:10,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321608841] [2023-11-26 12:04:10,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321608841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:10,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:10,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 12:04:10,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689474798] [2023-11-26 12:04:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:10,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:04:10,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:04:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:04:10,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2023-11-26 12:04:10,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 661 flow. Second operand has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-26 12:04:10,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:10,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2023-11-26 12:04:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:14,822 INFO L124 PetriNetUnfolderBase]: 15646/26358 cut-off events. [2023-11-26 12:04:14,822 INFO L125 PetriNetUnfolderBase]: For 97476/105199 co-relation queries the response was YES. [2023-11-26 12:04:14,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100363 conditions, 26358 events. 15646/26358 cut-off events. For 97476/105199 co-relation queries the response was YES. Maximal size of possible extension queue 1650. Compared 227874 event pairs, 3026 based on Foata normal form. 807/24742 useless extension candidates. Maximal degree in co-relation 100320. Up to 8739 conditions per place. [2023-11-26 12:04:15,020 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 104 selfloop transitions, 28 changer transitions 23/186 dead transitions. [2023-11-26 12:04:15,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 186 transitions, 1775 flow [2023-11-26 12:04:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 12:04:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 12:04:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2023-11-26 12:04:15,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6588541666666666 [2023-11-26 12:04:15,024 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 253 transitions. [2023-11-26 12:04:15,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 253 transitions. [2023-11-26 12:04:15,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 12:04:15,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 253 transitions. [2023-11-26 12:04:15,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 31.625) internal successors, (253), 8 states have internal predecessors, (253), 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-26 12:04:15,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:04:15,027 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 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-26 12:04:15,027 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 661 flow. Second operand 8 states and 253 transitions. [2023-11-26 12:04:15,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 186 transitions, 1775 flow [2023-11-26 12:04:15,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 186 transitions, 1654 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-11-26 12:04:15,323 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 882 flow [2023-11-26 12:04:15,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=882, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2023-11-26 12:04:15,324 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2023-11-26 12:04:15,324 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 882 flow [2023-11-26 12:04:15,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.0) internal successors, (147), 7 states have internal predecessors, (147), 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-26 12:04:15,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 12:04:15,325 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-26 12:04:15,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 12:04:15,325 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-26 12:04:15,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 12:04:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -631352503, now seen corresponding path program 2 times [2023-11-26 12:04:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 12:04:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233987850] [2023-11-26 12:04:15,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 12:04:15,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 12:04:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 12:04:15,517 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-26 12:04:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 12:04:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233987850] [2023-11-26 12:04:15,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233987850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 12:04:15,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 12:04:15,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 12:04:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193073194] [2023-11-26 12:04:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 12:04:15,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 12:04:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 12:04:15,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 12:04:15,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 12:04:15,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2023-11-26 12:04:15,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 882 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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-26 12:04:15,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 12:04:15,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2023-11-26 12:04:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 12:04:16,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L809-->L812: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][60], [Black: 118#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 240#(= ~a~0 1), Black: 251#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1)), 30#L767true, 24#L789true, Black: 246#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 200#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 50#L843-3true, 84#true, Black: 196#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 69#(= ~x~0 0), Black: 75#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L812true, Black: 207#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 206#(= ~x~0 1), Black: 133#(and (= ~z~0 1) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0~0 0)) (= ~z$w_buff1~0 0)), 204#true, 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 86#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 6#L749true, Black: 93#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 97#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 87#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 228#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), 268#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 249#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 129#true, P2Thread1of1ForFork0InUse, Black: 120#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), P3Thread1of1ForFork2InUse, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 114#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 253#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~__unbuffered_p3_EAX~0 1))]) [2023-11-26 12:04:16,330 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-26 12:04:16,330 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-26 12:04:16,330 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-26 12:04:16,330 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-26 12:04:16,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L749-->L752: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][63], [Black: 118#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 240#(= ~a~0 1), Black: 251#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (= ~__unbuffered_p3_EAX~0 1)), 30#L767true, Black: 249#(and (= ~a~0 1) (= ~__unbuffered_p3_EAX~0 1)), 24#L789true, Black: 200#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 50#L843-3true, Black: 196#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 87#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 69#(= ~x~0 0), Black: 75#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 73#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 207#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 133#(and (= ~z~0 1) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~z$w_buff0~0 0)) (= ~z$w_buff1~0 0)), 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 86#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0)), 14#L809true, Black: 93#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 97#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 234#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 246#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= 2 ~x~0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p3_EAX~0 0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 228#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 170#(and (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0)), 268#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 206#(= ~x~0 1), 11#L752true, 129#true, P2Thread1of1ForFork0InUse, Black: 120#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~z$w_buff0_used~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), P3Thread1of1ForFork2InUse, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 114#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))), Black: 253#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~__unbuffered_p3_EAX~0 1))]) [2023-11-26 12:04:16,526 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-26 12:04:16,526 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-26 12:04:16,526 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-26 12:04:16,526 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event