./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:04:16,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:04:16,704 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:04:16,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:04:16,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:04:16,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:04:16,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:04:16,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:04:16,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:04:16,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:04:16,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:04:16,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:04:16,766 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:04:16,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:04:16,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:04:16,769 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:04:16,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:04:16,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:04:16,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:04:16,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:04:16,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:04:16,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:04:16,772 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:04:16,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:04:16,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:04:16,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:04:16,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:04:16,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:04:16,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:16,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:04:16,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:04:16,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:04:16,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:04:16,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:04:16,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:04:16,778 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:04:16,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:04:16,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:04:16,779 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:04:16,779 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_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/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_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d5772eac83993f999ed7a0d2c72e283c734e18136b4020af8f8e407255c20c04 [2023-11-06 23:04:17,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:04:17,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:04:17,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:04:17,140 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:04:17,141 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:04:17,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2023-11-06 23:04:20,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:04:20,666 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:04:20,667 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i [2023-11-06 23:04:20,692 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/data/49f34dee9/b71540114ac8412c8a1bece941924a9a/FLAG622b4400d [2023-11-06 23:04:20,707 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/data/49f34dee9/b71540114ac8412c8a1bece941924a9a [2023-11-06 23:04:20,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:04:20,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:04:20,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:20,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:04:20,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:04:20,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:20" (1/1) ... [2023-11-06 23:04:20,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d93fdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:20, skipping insertion in model container [2023-11-06 23:04:20,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:20" (1/1) ... [2023-11-06 23:04:20,800 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:04:20,973 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_94aa64ed-ff34-4631-941f-52f0235d4a72/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2023-11-06 23:04:21,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:21,367 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:04:21,380 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_94aa64ed-ff34-4631-941f-52f0235d4a72/sv-benchmarks/c/goblint-regression/13-privatized_04-priv_multi_true.i[1087,1100] [2023-11-06 23:04:21,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:21,517 WARN L672 CHandler]: The function sleep is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:04:21,527 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:04:21,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21 WrapperNode [2023-11-06 23:04:21,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:21,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:21,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:04:21,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:04:21,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,618 INFO L138 Inliner]: procedures = 271, calls = 45, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-11-06 23:04:21,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:21,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:04:21,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:04:21,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:04:21,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:04:21,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:04:21,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:04:21,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:04:21,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (1/1) ... [2023-11-06 23:04:21,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:21,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:04:21,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:04:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure sleep [2023-11-06 23:04:21,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:04:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure generate [2023-11-06 23:04:21,769 INFO L138 BoogieDeclarations]: Found implementation of procedure generate [2023-11-06 23:04:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:04:21,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:04:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 23:04:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:04:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure dispose [2023-11-06 23:04:21,770 INFO L138 BoogieDeclarations]: Found implementation of procedure dispose [2023-11-06 23:04:21,770 INFO L130 BoogieDeclarations]: Found specification of procedure process [2023-11-06 23:04:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure process [2023-11-06 23:04:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:04:21,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:04:21,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:04:21,773 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:04:22,066 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:04:22,068 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:04:22,375 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:04:22,400 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:04:22,401 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 23:04:22,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:22 BoogieIcfgContainer [2023-11-06 23:04:22,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:04:22,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:04:22,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:04:22,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:04:22,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:04:20" (1/3) ... [2023-11-06 23:04:22,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a82a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:22, skipping insertion in model container [2023-11-06 23:04:22,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:21" (2/3) ... [2023-11-06 23:04:22,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a82a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:22, skipping insertion in model container [2023-11-06 23:04:22,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:22" (3/3) ... [2023-11-06 23:04:22,447 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_04-priv_multi_true.i [2023-11-06 23:04:22,457 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:04:22,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:04:22,469 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 23:04:22,469 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:04:22,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:04:22,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 155 transitions, 322 flow [2023-11-06 23:04:22,747 INFO L124 PetriNetUnfolderBase]: 12/152 cut-off events. [2023-11-06 23:04:22,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:22,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 152 events. 12/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 322 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-11-06 23:04:22,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 155 transitions, 322 flow [2023-11-06 23:04:22,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 152 transitions, 313 flow [2023-11-06 23:04:22,775 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:04:22,793 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 152 transitions, 313 flow [2023-11-06 23:04:22,799 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 152 transitions, 313 flow [2023-11-06 23:04:22,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 152 transitions, 313 flow [2023-11-06 23:04:22,878 INFO L124 PetriNetUnfolderBase]: 12/152 cut-off events. [2023-11-06 23:04:22,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:22,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 152 events. 12/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 321 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-11-06 23:04:22,895 INFO L119 LiptonReduction]: Number of co-enabled transitions 9322 [2023-11-06 23:04:28,036 INFO L134 LiptonReduction]: Checked pairs total: 19427 [2023-11-06 23:04:28,036 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-11-06 23:04:28,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:04:28,061 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=LoopsAndPotentialCycles, 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;@57acf455, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:04:28,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 23:04:28,069 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:04:28,070 INFO L124 PetriNetUnfolderBase]: 5/36 cut-off events. [2023-11-06 23:04:28,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:28,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:28,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:28,072 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:04:28,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1661247459, now seen corresponding path program 1 times [2023-11-06 23:04:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:28,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400252977] [2023-11-06 23:04:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:28,974 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-06 23:04:28,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400252977] [2023-11-06 23:04:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400252977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:28,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:04:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558588276] [2023-11-06 23:04:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:28,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:29,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:29,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 281 [2023-11-06 23:04:29,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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-06 23:04:29,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:29,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 281 [2023-11-06 23:04:29,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:32,300 INFO L124 PetriNetUnfolderBase]: 20656/27959 cut-off events. [2023-11-06 23:04:32,300 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-06 23:04:32,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55221 conditions, 27959 events. 20656/27959 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 151705 event pairs, 5884 based on Foata normal form. 384/22970 useless extension candidates. Maximal degree in co-relation 55210. Up to 16351 conditions per place. [2023-11-06 23:04:32,573 INFO L140 encePairwiseOnDemand]: 268/281 looper letters, 66 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2023-11-06 23:04:32,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 321 flow [2023-11-06 23:04:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-06 23:04:32,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5741399762752076 [2023-11-06 23:04:32,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-06 23:04:32,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-06 23:04:32,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:32,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-06 23:04:32,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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-06 23:04:32,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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-06 23:04:32,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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-06 23:04:32,629 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 103 flow. Second operand 3 states and 484 transitions. [2023-11-06 23:04:32,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 321 flow [2023-11-06 23:04:32,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:04:32,640 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 158 flow [2023-11-06 23:04:32,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-11-06 23:04:32,646 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-11-06 23:04:32,647 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 158 flow [2023-11-06 23:04:32,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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-06 23:04:32,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:32,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:04:32,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:04:32,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -58474824, now seen corresponding path program 1 times [2023-11-06 23:04:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409338221] [2023-11-06 23:04:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:32,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:32,943 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-06 23:04:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:32,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409338221] [2023-11-06 23:04:32,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409338221] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:32,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:32,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:32,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204924819] [2023-11-06 23:04:32,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:32,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:32,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:32,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:32,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:32,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 281 [2023-11-06 23:04:32,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-06 23:04:32,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:32,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 281 [2023-11-06 23:04:32,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:39,298 INFO L124 PetriNetUnfolderBase]: 48963/67049 cut-off events. [2023-11-06 23:04:39,298 INFO L125 PetriNetUnfolderBase]: For 14700/15012 co-relation queries the response was YES. [2023-11-06 23:04:39,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149766 conditions, 67049 events. 48963/67049 cut-off events. For 14700/15012 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 391898 event pairs, 11295 based on Foata normal form. 2/55932 useless extension candidates. Maximal degree in co-relation 149754. Up to 25599 conditions per place. [2023-11-06 23:04:39,709 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 128 selfloop transitions, 8 changer transitions 0/144 dead transitions. [2023-11-06 23:04:39,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 144 transitions, 696 flow [2023-11-06 23:04:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:04:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 804 transitions. [2023-11-06 23:04:39,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722419928825623 [2023-11-06 23:04:39,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 804 transitions. [2023-11-06 23:04:39,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 804 transitions. [2023-11-06 23:04:39,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:39,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 804 transitions. [2023-11-06 23:04:39,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 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-06 23:04:39,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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-06 23:04:39,729 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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-06 23:04:39,729 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 158 flow. Second operand 5 states and 804 transitions. [2023-11-06 23:04:39,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 144 transitions, 696 flow [2023-11-06 23:04:39,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 144 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:39,797 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 218 flow [2023-11-06 23:04:39,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2023-11-06 23:04:39,800 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-11-06 23:04:39,800 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 218 flow [2023-11-06 23:04:39,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-06 23:04:39,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:39,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:39,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:04:39,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:04:39,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1910375260, now seen corresponding path program 1 times [2023-11-06 23:04:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385636908] [2023-11-06 23:04:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:39,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,981 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-06 23:04:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:39,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385636908] [2023-11-06 23:04:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385636908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684201885] [2023-11-06 23:04:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:39,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:39,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:39,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:40,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-11-06 23:04:40,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-06 23:04:40,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:40,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-11-06 23:04:40,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:48,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [Black: 156#true, 72#L19-5true, 2#L1190true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-06 23:04:48,597 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 23:04:48,597 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:04:48,598 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:04:48,598 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:04:48,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 2#L1190true, 14#L1161true, 73#L1173true, 41#L1210true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-06 23:04:48,598 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 23:04:48,598 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 23:04:48,598 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:04:48,598 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:04:48,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 60#L1205-4true, 2#L1190true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-06 23:04:48,855 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 23:04:48,856 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:04:48,856 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:04:48,856 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:04:49,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 2#L1190true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 17#L1205-6true, processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse]) [2023-11-06 23:04:49,112 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 23:04:49,112 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:04:49,112 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:04:49,113 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:04:49,571 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [Black: 156#true, 2#L1190true, 73#L1173true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 87#L1206-1true, processThread1of1ForFork2InUse, 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse]) [2023-11-06 23:04:49,572 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:04:49,572 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:04:49,572 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:04:49,572 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:04:49,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][74], [Black: 156#true, 2#L1190true, 14#L1161true, 73#L1173true, 3#ULTIMATE.startEXITtrue, Black: 162#true, Black: 164#(= 5 ~B~0), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-06 23:04:49,573 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:04:49,574 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:04:49,574 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 23:04:49,574 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 23:04:49,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L1171-1-->L1173: Formula: (= v_~A~0_12 v_~B~0_11) InVars {~A~0=v_~A~0_12} OutVars{~A~0=v_~A~0_12, processThread1of1ForFork2_#t~nondet6=|v_processThread1of1ForFork2_#t~nondet6_9|, ~B~0=v_~B~0_11} AuxVars[] AssignedVars[processThread1of1ForFork2_#t~nondet6, ~B~0][67], [Black: 156#true, 2#L1190true, 104#L1208true, 14#L1161true, 73#L1173true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse]) [2023-11-06 23:04:49,686 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 23:04:49,686 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 23:04:49,686 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 23:04:49,686 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 23:04:49,812 INFO L124 PetriNetUnfolderBase]: 78426/108805 cut-off events. [2023-11-06 23:04:49,812 INFO L125 PetriNetUnfolderBase]: For 48361/50792 co-relation queries the response was YES. [2023-11-06 23:04:50,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264223 conditions, 108805 events. 78426/108805 cut-off events. For 48361/50792 co-relation queries the response was YES. Maximal size of possible extension queue 2825. Compared 728195 event pairs, 18581 based on Foata normal form. 2304/98136 useless extension candidates. Maximal degree in co-relation 264207. Up to 64396 conditions per place. [2023-11-06 23:04:50,507 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 78 selfloop transitions, 13 changer transitions 0/101 dead transitions. [2023-11-06 23:04:50,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 101 transitions, 560 flow [2023-11-06 23:04:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-11-06 23:04:50,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504151838671412 [2023-11-06 23:04:50,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-11-06 23:04:50,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-11-06 23:04:50,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:50,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-11-06 23:04:50,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-06 23:04:50,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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-06 23:04:50,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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-06 23:04:50,518 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 218 flow. Second operand 3 states and 464 transitions. [2023-11-06 23:04:50,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 101 transitions, 560 flow [2023-11-06 23:04:50,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 560 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:04:50,539 INFO L231 Difference]: Finished difference. Result has 58 places, 68 transitions, 307 flow [2023-11-06 23:04:50,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=58, PETRI_TRANSITIONS=68} [2023-11-06 23:04:50,541 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2023-11-06 23:04:50,541 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 68 transitions, 307 flow [2023-11-06 23:04:50,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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-06 23:04:50,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:50,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:50,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:04:50,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:04:50,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1317908023, now seen corresponding path program 1 times [2023-11-06 23:04:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065171168] [2023-11-06 23:04:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:50,779 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-06 23:04:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065171168] [2023-11-06 23:04:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065171168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:50,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:50,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324149236] [2023-11-06 23:04:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:50,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:50,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:50,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 281 [2023-11-06 23:04:50,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 68 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 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-06 23:04:50,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:50,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 281 [2023-11-06 23:04:50,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:02,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,062 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:05:02,063 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,063 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,063 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,064 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 23:05:02,064 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,064 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,064 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 162#true, 14#L1161true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,102 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 23:05:02,103 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,103 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,103 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:05:02,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [72#L19-5true, Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,104 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 23:05:02,104 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,104 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,104 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:05:02,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,164 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,164 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,164 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,165 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 23:05:02,165 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,165 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,165 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 128#L1160true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,166 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 23:05:02,166 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,166 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 23:05:02,166 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, 14#L1161true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,197 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 23:05:02,197 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,197 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,197 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:05:02,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,197 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 23:05:02,197 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:05:02,198 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,198 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, 14#L1161true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,198 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 23:05:02,198 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:05:02,199 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,199 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, 14#L1161true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,199 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 23:05:02,199 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 23:05:02,199 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,200 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 23:05:02,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 12#L1157-6true, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,249 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 23:05:02,250 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,250 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,250 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, 12#L1157-6true, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,251 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 23:05:02,251 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,251 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,251 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 12#L1157-6true, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,252 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 23:05:02,253 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,253 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,253 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 12#L1157-6true, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,254 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 23:05:02,254 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,254 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,254 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,297 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,298 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,298 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,298 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,299 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,299 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,299 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,299 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, 91#generateEXITtrue, Black: 164#(= 5 ~B~0), Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,300 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,300 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,301 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,301 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, 91#generateEXITtrue, Black: 164#(= 5 ~B~0), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,301 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,302 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,302 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,302 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 87#L1206-1true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,319 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-06 23:05:02,319 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,319 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 23:05:02,319 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 23:05:02,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 87#L1206-1true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,320 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-06 23:05:02,320 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 23:05:02,320 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,320 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 23:05:02,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, 104#L1208true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,347 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-06 23:05:02,347 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,347 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,347 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,348 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, 104#L1208true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,348 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-06 23:05:02,348 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,348 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,348 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:05:02,380 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,380 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-06 23:05:02,380 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,380 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,380 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,380 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,381 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 139#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 178#true, 23#L1175true]) [2023-11-06 23:05:02,381 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-06 23:05:02,381 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,381 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,381 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,381 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,382 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([555] L1190-->disposeErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|) (= (store |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52| (store (select |v_#pthreadsMutex_122| |v_~#mutex_B~0.base_52|) |v_~#mutex_B~0.offset_52| 0)) |v_#pthreadsMutex_121|) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31| (ite (= 5 |v_disposeThread1of1ForFork0_~p~0#1_17|) 1 0)) (= |v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_122|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, #pthreadsMutex=|v_#pthreadsMutex_121|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_17|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_52|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_52|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_31|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1][120], [Black: 158#(= ~B~0 ~A~0), 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), 173#true, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), 61#disposeErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,382 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-06 23:05:02,382 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,382 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,382 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,382 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,382 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([561] L1190-->L1186-2: Formula: (and (= |v_#pthreadsMutex_Out_2| (store |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1| (store (select |v_#pthreadsMutex_In_1| |v_~#mutex_B~0.base_In_1|) |v_~#mutex_B~0.offset_In_1| 0))) (not (= (ite (= |v_disposeThread1of1ForFork0_~p~0#1_In_1| 5) 1 0) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_In_1|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|} OutVars{disposeThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_~cond#1_Out_2|, #pthreadsMutex=|v_#pthreadsMutex_Out_2|, disposeThread1of1ForFork0_~p~0#1=|v_disposeThread1of1ForFork0_~p~0#1_In_1|, ~#mutex_B~0.base=|v_~#mutex_B~0.base_In_1|, ~#mutex_B~0.offset=|v_~#mutex_B~0.offset_In_1|, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1_Out_2|, disposeThread1of1ForFork0_#t~ret11#1=|v_disposeThread1of1ForFork0_#t~ret11#1_Out_2|} AuxVars[] AssignedVars[disposeThread1of1ForFork0___VERIFIER_assert_~cond#1, #pthreadsMutex, disposeThread1of1ForFork0___VERIFIER_assert_#in~cond#1, disposeThread1of1ForFork0_#t~ret11#1][121], [Black: 158#(= ~B~0 ~A~0), 18#L1186-2true, Black: 162#true, Black: 164#(= 5 ~B~0), 91#generateEXITtrue, Black: 167#(and (= 5 |disposeThread1of1ForFork0_~p~0#1|) (= 5 ~B~0)), 173#true, 119#L19-2true, Black: 175#(= (select (select |#pthreadsMutex| |~#mutex_A~0.base|) |~#mutex_A~0.offset|) 1), processThread1of1ForFork2InUse, disposeThread1of1ForFork0InUse, 165#(= 5 |disposeThread1of1ForFork0_~p~0#1|), generateThread1of1ForFork1InUse, 23#L1175true, 178#true]) [2023-11-06 23:05:02,383 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-06 23:05:02,383 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,383 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 23:05:02,383 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 23:05:02,383 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 23:05:02,916 INFO L124 PetriNetUnfolderBase]: 93186/127246 cut-off events. [2023-11-06 23:05:02,916 INFO L125 PetriNetUnfolderBase]: For 125269/130834 co-relation queries the response was YES. [2023-11-06 23:05:03,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380154 conditions, 127246 events. 93186/127246 cut-off events. For 125269/130834 co-relation queries the response was YES. Maximal size of possible extension queue 3010. Compared 805794 event pairs, 21047 based on Foata normal form. 2594/123905 useless extension candidates. Maximal degree in co-relation 380136. Up to 56332 conditions per place. [2023-11-06 23:05:03,840 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 158 selfloop transitions, 19 changer transitions 0/185 dead transitions. [2023-11-06 23:05:03,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 185 transitions, 1153 flow [2023-11-06 23:05:03,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:05:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 803 transitions. [2023-11-06 23:05:03,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5715302491103202 [2023-11-06 23:05:03,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 803 transitions. [2023-11-06 23:05:03,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 803 transitions. [2023-11-06 23:05:03,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:03,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 803 transitions. [2023-11-06 23:05:03,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.6) internal successors, (803), 5 states have internal predecessors, (803), 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-06 23:05:03,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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-06 23:05:03,857 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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-06 23:05:03,858 INFO L175 Difference]: Start difference. First operand has 58 places, 68 transitions, 307 flow. Second operand 5 states and 803 transitions. [2023-11-06 23:05:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 185 transitions, 1153 flow [2023-11-06 23:05:03,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 185 transitions, 1108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:05:03,931 INFO L231 Difference]: Finished difference. Result has 64 places, 81 transitions, 445 flow [2023-11-06 23:05:03,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=64, PETRI_TRANSITIONS=81} [2023-11-06 23:05:03,933 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-11-06 23:05:03,933 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 81 transitions, 445 flow [2023-11-06 23:05:03,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 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-06 23:05:03,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:03,934 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-06 23:05:03,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:05:03,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:05:03,935 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:03,936 INFO L85 PathProgramCache]: Analyzing trace with hash -803296804, now seen corresponding path program 1 times [2023-11-06 23:05:03,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:03,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807108836] [2023-11-06 23:05:03,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:03,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:04,262 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-06 23:05:04,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:04,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807108836] [2023-11-06 23:05:04,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807108836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:04,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:04,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:05:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903229386] [2023-11-06 23:05:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:04,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:05:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:05:04,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:05:04,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 281 [2023-11-06 23:05:04,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 81 transitions, 445 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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-06 23:05:04,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:04,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 281 [2023-11-06 23:05:04,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:06,000 INFO L124 PetriNetUnfolderBase]: 10261/15589 cut-off events. [2023-11-06 23:05:06,001 INFO L125 PetriNetUnfolderBase]: For 18631/19161 co-relation queries the response was YES. [2023-11-06 23:05:06,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43771 conditions, 15589 events. 10261/15589 cut-off events. For 18631/19161 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 91591 event pairs, 1836 based on Foata normal form. 1566/16984 useless extension candidates. Maximal degree in co-relation 43749. Up to 12402 conditions per place. [2023-11-06 23:05:06,106 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 59 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2023-11-06 23:05:06,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 540 flow [2023-11-06 23:05:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2023-11-06 23:05:06,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231316725978647 [2023-11-06 23:05:06,110 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2023-11-06 23:05:06,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2023-11-06 23:05:06,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:06,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2023-11-06 23:05:06,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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-06 23:05:06,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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-06 23:05:06,117 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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-06 23:05:06,117 INFO L175 Difference]: Start difference. First operand has 64 places, 81 transitions, 445 flow. Second operand 4 states and 588 transitions. [2023-11-06 23:05:06,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 540 flow [2023-11-06 23:05:06,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 527 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 23:05:06,148 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 345 flow [2023-11-06 23:05:06,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2023-11-06 23:05:06,149 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-11-06 23:05:06,150 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 345 flow [2023-11-06 23:05:06,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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-06 23:05:06,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:06,150 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-06 23:05:06,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:05:06,151 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:05:06,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1757191459, now seen corresponding path program 1 times [2023-11-06 23:05:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:06,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319153186] [2023-11-06 23:05:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:06,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:06,360 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-06 23:05:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319153186] [2023-11-06 23:05:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319153186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:05:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362126519] [2023-11-06 23:05:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:06,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:05:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:05:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:05:06,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 281 [2023-11-06 23:05:06,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 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-06 23:05:06,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:06,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 281 [2023-11-06 23:05:06,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:07,540 INFO L124 PetriNetUnfolderBase]: 7461/11449 cut-off events. [2023-11-06 23:05:07,540 INFO L125 PetriNetUnfolderBase]: For 11106/11195 co-relation queries the response was YES. [2023-11-06 23:05:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32253 conditions, 11449 events. 7461/11449 cut-off events. For 11106/11195 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 64632 event pairs, 1679 based on Foata normal form. 574/11974 useless extension candidates. Maximal degree in co-relation 32230. Up to 6596 conditions per place. [2023-11-06 23:05:07,596 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 62 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2023-11-06 23:05:07,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 609 flow [2023-11-06 23:05:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:05:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:05:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-06 23:05:07,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124555160142349 [2023-11-06 23:05:07,599 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-06 23:05:07,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-06 23:05:07,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:07,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-06 23:05:07,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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-06 23:05:07,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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-06 23:05:07,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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-06 23:05:07,605 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 345 flow. Second operand 4 states and 576 transitions. [2023-11-06 23:05:07,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 609 flow [2023-11-06 23:05:07,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 586 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:07,627 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 363 flow [2023-11-06 23:05:07,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-11-06 23:05:07,631 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-11-06 23:05:07,631 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 363 flow [2023-11-06 23:05:07,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 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-06 23:05:07,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:07,632 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-06 23:05:07,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:05:07,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:05:07,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1093662389, now seen corresponding path program 1 times [2023-11-06 23:05:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:07,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326311353] [2023-11-06 23:05:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:07,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:07,883 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-06 23:05:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326311353] [2023-11-06 23:05:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326311353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:05:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794224765] [2023-11-06 23:05:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:07,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:05:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:05:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:05:07,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 281 [2023-11-06 23:05:07,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 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-06 23:05:07,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:07,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 281 [2023-11-06 23:05:07,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:11,259 INFO L124 PetriNetUnfolderBase]: 19309/28105 cut-off events. [2023-11-06 23:05:11,259 INFO L125 PetriNetUnfolderBase]: For 30818/30819 co-relation queries the response was YES. [2023-11-06 23:05:11,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81186 conditions, 28105 events. 19309/28105 cut-off events. For 30818/30819 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 151540 event pairs, 3830 based on Foata normal form. 1317/29367 useless extension candidates. Maximal degree in co-relation 81162. Up to 7164 conditions per place. [2023-11-06 23:05:11,397 INFO L140 encePairwiseOnDemand]: 264/281 looper letters, 357 selfloop transitions, 72 changer transitions 3/436 dead transitions. [2023-11-06 23:05:11,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 436 transitions, 2848 flow [2023-11-06 23:05:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:05:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-06 23:05:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3327 transitions. [2023-11-06 23:05:11,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147764196193718 [2023-11-06 23:05:11,410 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3327 transitions. [2023-11-06 23:05:11,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3327 transitions. [2023-11-06 23:05:11,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:11,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3327 transitions. [2023-11-06 23:05:11,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 144.65217391304347) internal successors, (3327), 23 states have internal predecessors, (3327), 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-06 23:05:11,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 281.0) internal successors, (6744), 24 states have internal predecessors, (6744), 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-06 23:05:11,440 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 281.0) internal successors, (6744), 24 states have internal predecessors, (6744), 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-06 23:05:11,440 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 363 flow. Second operand 23 states and 3327 transitions. [2023-11-06 23:05:11,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 436 transitions, 2848 flow [2023-11-06 23:05:11,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 436 transitions, 2754 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:05:11,497 INFO L231 Difference]: Finished difference. Result has 107 places, 129 transitions, 1175 flow [2023-11-06 23:05:11,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1175, PETRI_PLACES=107, PETRI_TRANSITIONS=129} [2023-11-06 23:05:11,498 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 57 predicate places. [2023-11-06 23:05:11,499 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 129 transitions, 1175 flow [2023-11-06 23:05:11,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 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-06 23:05:11,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:11,500 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-06 23:05:11,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:05:11,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:05:11,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash 216790017, now seen corresponding path program 1 times [2023-11-06 23:05:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:11,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116102060] [2023-11-06 23:05:11,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:11,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:11,705 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-06 23:05:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:11,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116102060] [2023-11-06 23:05:11,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116102060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:05:11,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:05:11,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:05:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857742968] [2023-11-06 23:05:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:05:11,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:05:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:05:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:05:11,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-11-06 23:05:11,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 129 transitions, 1175 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 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-06 23:05:11,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:11,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-11-06 23:05:11,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:15,258 INFO L124 PetriNetUnfolderBase]: 16256/24711 cut-off events. [2023-11-06 23:05:15,258 INFO L125 PetriNetUnfolderBase]: For 149589/150554 co-relation queries the response was YES. [2023-11-06 23:05:15,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96896 conditions, 24711 events. 16256/24711 cut-off events. For 149589/150554 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 145584 event pairs, 7333 based on Foata normal form. 506/24993 useless extension candidates. Maximal degree in co-relation 96851. Up to 12476 conditions per place. [2023-11-06 23:05:15,449 INFO L140 encePairwiseOnDemand]: 271/281 looper letters, 131 selfloop transitions, 34 changer transitions 0/188 dead transitions. [2023-11-06 23:05:15,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 188 transitions, 1924 flow [2023-11-06 23:05:15,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:05:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:05:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 754 transitions. [2023-11-06 23:05:15,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366548042704626 [2023-11-06 23:05:15,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 754 transitions. [2023-11-06 23:05:15,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 754 transitions. [2023-11-06 23:05:15,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:15,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 754 transitions. [2023-11-06 23:05:15,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 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-06 23:05:15,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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-06 23:05:15,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 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-06 23:05:15,461 INFO L175 Difference]: Start difference. First operand has 107 places, 129 transitions, 1175 flow. Second operand 5 states and 754 transitions. [2023-11-06 23:05:15,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 188 transitions, 1924 flow [2023-11-06 23:05:15,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 188 transitions, 1896 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-11-06 23:05:15,798 INFO L231 Difference]: Finished difference. Result has 113 places, 130 transitions, 1295 flow [2023-11-06 23:05:15,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1295, PETRI_PLACES=113, PETRI_TRANSITIONS=130} [2023-11-06 23:05:15,799 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 63 predicate places. [2023-11-06 23:05:15,799 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 130 transitions, 1295 flow [2023-11-06 23:05:15,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 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-06 23:05:15,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:05:15,800 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:15,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:05:15,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting disposeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-06 23:05:15,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:05:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1272228365, now seen corresponding path program 1 times [2023-11-06 23:05:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:05:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237626088] [2023-11-06 23:05:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:05:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:05:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:05:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237626088] [2023-11-06 23:05:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237626088] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:05:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156426606] [2023-11-06 23:05:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:05:16,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:05:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:05:16,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:05:16,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:05:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:05:16,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 23:05:16,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:05:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:05:16,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:05:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 23:05:16,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156426606] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:05:16,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:05:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-11-06 23:05:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530134590] [2023-11-06 23:05:16,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:05:16,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:05:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:05:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:05:16,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:05:17,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 281 [2023-11-06 23:05:17,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 130 transitions, 1295 flow. Second operand has 9 states, 9 states have (on average 128.55555555555554) internal successors, (1157), 9 states have internal predecessors, (1157), 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-06 23:05:17,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:05:17,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 281 [2023-11-06 23:05:17,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:05:20,179 INFO L124 PetriNetUnfolderBase]: 13542/19991 cut-off events. [2023-11-06 23:05:20,179 INFO L125 PetriNetUnfolderBase]: For 127902/127903 co-relation queries the response was YES. [2023-11-06 23:05:20,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70856 conditions, 19991 events. 13542/19991 cut-off events. For 127902/127903 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 105339 event pairs, 2839 based on Foata normal form. 1290/21278 useless extension candidates. Maximal degree in co-relation 70807. Up to 6838 conditions per place. [2023-11-06 23:05:20,276 INFO L140 encePairwiseOnDemand]: 265/281 looper letters, 0 selfloop transitions, 0 changer transitions 294/294 dead transitions. [2023-11-06 23:05:20,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 294 transitions, 2799 flow [2023-11-06 23:05:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:05:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 23:05:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2213 transitions. [2023-11-06 23:05:20,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922153024911032 [2023-11-06 23:05:20,285 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2213 transitions. [2023-11-06 23:05:20,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2213 transitions. [2023-11-06 23:05:20,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:05:20,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2213 transitions. [2023-11-06 23:05:20,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 138.3125) internal successors, (2213), 16 states have internal predecessors, (2213), 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-06 23:05:20,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 281.0) internal successors, (4777), 17 states have internal predecessors, (4777), 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-06 23:05:20,304 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 281.0) internal successors, (4777), 17 states have internal predecessors, (4777), 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-06 23:05:20,304 INFO L175 Difference]: Start difference. First operand has 113 places, 130 transitions, 1295 flow. Second operand 16 states and 2213 transitions. [2023-11-06 23:05:20,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 294 transitions, 2799 flow [2023-11-06 23:05:20,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 294 transitions, 2707 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-11-06 23:05:20,684 INFO L231 Difference]: Finished difference. Result has 119 places, 0 transitions, 0 flow [2023-11-06 23:05:20,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=119, PETRI_TRANSITIONS=0} [2023-11-06 23:05:20,685 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 69 predicate places. [2023-11-06 23:05:20,685 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 0 transitions, 0 flow [2023-11-06 23:05:20,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 128.55555555555554) internal successors, (1157), 9 states have internal predecessors, (1157), 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-06 23:05:20,688 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-06 23:05:20,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-11-06 23:05:20,689 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-06 23:05:20,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-06 23:05:20,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-06 23:05:20,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location disposeErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-06 23:05:20,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:20,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 23:05:20,897 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:20,902 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:05:20,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:05:20,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:05:20 BasicIcfg [2023-11-06 23:05:20,906 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:05:20,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:05:20,907 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:05:20,907 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:05:20,908 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:22" (3/4) ... [2023-11-06 23:05:20,910 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:05:20,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure process [2023-11-06 23:05:20,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dispose [2023-11-06 23:05:20,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure generate [2023-11-06 23:05:20,921 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 23:05:20,921 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 23:05:20,922 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:05:20,922 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:05:20,980 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:05:20,980 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:05:20,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:05:20,981 INFO L158 Benchmark]: Toolchain (without parser) took 60269.73ms. Allocated memory was 180.4MB in the beginning and 14.2GB in the end (delta: 14.0GB). Free memory was 147.2MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2023-11-06 23:05:20,981 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory was 81.2MB in the beginning and 81.0MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:20,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.04ms. Allocated memory is still 180.4MB. Free memory was 147.2MB in the beginning and 116.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-06 23:05:20,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.96ms. Allocated memory is still 180.4MB. Free memory was 116.1MB in the beginning and 113.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:20,983 INFO L158 Benchmark]: Boogie Preprocessor took 63.26ms. Allocated memory is still 180.4MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:05:20,983 INFO L158 Benchmark]: RCFGBuilder took 720.02ms. Allocated memory is still 180.4MB. Free memory was 110.7MB in the beginning and 89.0MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 23:05:20,983 INFO L158 Benchmark]: TraceAbstraction took 58498.43ms. Allocated memory was 180.4MB in the beginning and 14.2GB in the end (delta: 14.0GB). Free memory was 88.4MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2023-11-06 23:05:20,984 INFO L158 Benchmark]: Witness Printer took 73.50ms. Allocated memory is still 14.2GB. Free memory was 11.5GB in the beginning and 11.5GB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:20,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory was 81.2MB in the beginning and 81.0MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 815.04ms. Allocated memory is still 180.4MB. Free memory was 147.2MB in the beginning and 116.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.96ms. Allocated memory is still 180.4MB. Free memory was 116.1MB in the beginning and 113.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.26ms. Allocated memory is still 180.4MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 720.02ms. Allocated memory is still 180.4MB. Free memory was 110.7MB in the beginning and 89.0MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 58498.43ms. Allocated memory was 180.4MB in the beginning and 14.2GB in the end (delta: 14.0GB). Free memory was 88.4MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 73.50ms. Allocated memory is still 14.2GB. Free memory was 11.5GB in the beginning and 11.5GB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 150 PlacesBefore, 50 PlacesAfterwards, 152 TransitionsBefore, 47 TransitionsAfterwards, 9322 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 5 ChoiceCompositions, 126 TotalNumberOfCompositions, 19427 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9009, independent: 8660, independent conditional: 0, independent unconditional: 8660, dependent: 349, dependent conditional: 0, dependent unconditional: 349, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4824, independent: 4748, independent conditional: 0, independent unconditional: 4748, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9009, independent: 3912, independent conditional: 0, independent unconditional: 3912, dependent: 273, dependent conditional: 0, dependent unconditional: 273, unknown: 4824, unknown conditional: 0, unknown unconditional: 4824] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 256, Positive conditional cache size: 0, Positive unconditional cache size: 256, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 212 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 58.3s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 48.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1082 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 336 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3134 IncrementalHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 55 mSDtfsCounter, 3134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1295occurred in iteration=8, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 7 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-06 23:05:21,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94aa64ed-ff34-4631-941f-52f0235d4a72/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE