./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:33:05,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:33:05,469 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:33:05,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:33:05,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:33:05,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:33:05,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:33:05,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:33:05,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:33:05,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:33:05,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:33:05,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:33:05,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:33:05,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:33:05,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:33:05,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:33:05,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:33:05,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:33:05,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:05,507 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:33:05,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:33:05,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:33:05,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:05,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:33:05,508 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-28 03:33:05,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:33:05,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:33:05,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:33:05,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:33:05,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:33:05,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-28 03:33:08,837 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/data/ce282f5cf/4a669ec6e38444d2ae889fcd547fac27/FLAGabdd95a98 [2024-11-28 03:33:09,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:33:09,209 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-28 03:33:09,232 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/data/ce282f5cf/4a669ec6e38444d2ae889fcd547fac27/FLAGabdd95a98 [2024-11-28 03:33:09,409 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/data/ce282f5cf/4a669ec6e38444d2ae889fcd547fac27 [2024-11-28 03:33:09,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:33:09,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:33:09,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:33:09,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:33:09,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:33:09,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:33:09" (1/1) ... [2024-11-28 03:33:09,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf60f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:09, skipping insertion in model container [2024-11-28 03:33:09,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:33:09" (1/1) ... [2024-11-28 03:33:09,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:33:09,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:33:09,900 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:33:09,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:33:10,011 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:33:10,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10 WrapperNode [2024-11-28 03:33:10,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:33:10,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:33:10,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:33:10,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:33:10,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,078 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 232 [2024-11-28 03:33:10,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:33:10,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:33:10,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:33:10,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:33:10,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,122 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:33:10,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:33:10,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:33:10,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:33:10,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (1/1) ... [2024-11-28 03:33:10,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:33:10,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:33:10,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:33:10,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:33:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:33:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-28 03:33:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-28 03:33:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-28 03:33:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-28 03:33:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:33:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 03:33:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:33:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-28 03:33:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:33:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 03:33:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:33:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:33:10,230 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:33:10,412 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:33:10,414 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:33:11,018 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:33:11,019 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:33:11,076 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:33:11,076 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 03:33:11,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:11 BoogieIcfgContainer [2024-11-28 03:33:11,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:33:11,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:33:11,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:33:11,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:33:11,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:33:09" (1/3) ... [2024-11-28 03:33:11,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f91613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:33:11, skipping insertion in model container [2024-11-28 03:33:11,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:33:10" (2/3) ... [2024-11-28 03:33:11,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f91613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:33:11, skipping insertion in model container [2024-11-28 03:33:11,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:11" (3/3) ... [2024-11-28 03:33:11,092 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-28 03:33:11,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:33:11,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 264 locations, 1 initial locations, 2 loop locations, and 29 error locations. [2024-11-28 03:33:11,113 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:33:11,310 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 03:33:11,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 277 transitions, 568 flow [2024-11-28 03:33:11,547 INFO L124 PetriNetUnfolderBase]: 14/275 cut-off events. [2024-11-28 03:33:11,552 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:33:11,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 275 events. 14/275 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 647 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2024-11-28 03:33:11,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 277 transitions, 568 flow [2024-11-28 03:33:11,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 270 transitions, 549 flow [2024-11-28 03:33:11,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:33:11,599 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c6b1832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:33:11,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-28 03:33:11,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:33:11,624 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2024-11-28 03:33:11,624 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:33:11,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:11,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:11,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:11,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:11,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1459715482, now seen corresponding path program 1 times [2024-11-28 03:33:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:11,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000050831] [2024-11-28 03:33:11,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:11,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:11,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000050831] [2024-11-28 03:33:11,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000050831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:11,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:11,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392019231] [2024-11-28 03:33:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:12,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:12,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:12,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:12,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 277 [2024-11-28 03:33:12,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 270 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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) [2024-11-28 03:33:12,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:12,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 277 [2024-11-28 03:33:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:12,398 INFO L124 PetriNetUnfolderBase]: 55/645 cut-off events. [2024-11-28 03:33:12,399 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-28 03:33:12,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 645 events. 55/645 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3332 event pairs, 27 based on Foata normal form. 34/565 useless extension candidates. Maximal degree in co-relation 630. Up to 79 conditions per place. [2024-11-28 03:33:12,413 INFO L140 encePairwiseOnDemand]: 268/277 looper letters, 16 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2024-11-28 03:33:12,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 563 flow [2024-11-28 03:33:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-11-28 03:33:12,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9290012033694344 [2024-11-28 03:33:12,437 INFO L175 Difference]: Start difference. First operand has 263 places, 270 transitions, 549 flow. Second operand 3 states and 772 transitions. [2024-11-28 03:33:12,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 563 flow [2024-11-28 03:33:12,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 259 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:33:12,455 INFO L231 Difference]: Finished difference. Result has 257 places, 259 transitions, 526 flow [2024-11-28 03:33:12,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=257, PETRI_TRANSITIONS=259} [2024-11-28 03:33:12,466 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2024-11-28 03:33:12,466 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 259 transitions, 526 flow [2024-11-28 03:33:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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) [2024-11-28 03:33:12,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:12,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:12,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:33:12,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:12,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1460135496, now seen corresponding path program 1 times [2024-11-28 03:33:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763986988] [2024-11-28 03:33:12,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763986988] [2024-11-28 03:33:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763986988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:12,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:12,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975569175] [2024-11-28 03:33:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:12,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:12,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:12,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:12,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 277 [2024-11-28 03:33:12,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 259 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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) [2024-11-28 03:33:12,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:12,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 277 [2024-11-28 03:33:12,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:12,887 INFO L124 PetriNetUnfolderBase]: 59/648 cut-off events. [2024-11-28 03:33:12,887 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-28 03:33:12,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 648 events. 59/648 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3411 event pairs, 31 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 707. Up to 89 conditions per place. [2024-11-28 03:33:12,894 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 18 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-11-28 03:33:12,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 258 transitions, 564 flow [2024-11-28 03:33:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-28 03:33:12,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9169675090252708 [2024-11-28 03:33:12,899 INFO L175 Difference]: Start difference. First operand has 257 places, 259 transitions, 526 flow. Second operand 3 states and 762 transitions. [2024-11-28 03:33:12,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 258 transitions, 564 flow [2024-11-28 03:33:12,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 258 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:12,909 INFO L231 Difference]: Finished difference. Result has 256 places, 258 transitions, 524 flow [2024-11-28 03:33:12,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=256, PETRI_TRANSITIONS=258} [2024-11-28 03:33:12,911 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -7 predicate places. [2024-11-28 03:33:12,911 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 258 transitions, 524 flow [2024-11-28 03:33:12,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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) [2024-11-28 03:33:12,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:12,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:33:12,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1264078219, now seen corresponding path program 1 times [2024-11-28 03:33:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963111530] [2024-11-28 03:33:12,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963111530] [2024-11-28 03:33:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963111530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:13,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:13,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:13,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772770434] [2024-11-28 03:33:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:13,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:13,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:13,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:13,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:13,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 277 [2024-11-28 03:33:13,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 258 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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) [2024-11-28 03:33:13,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:13,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 277 [2024-11-28 03:33:13,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:13,419 INFO L124 PetriNetUnfolderBase]: 125/1218 cut-off events. [2024-11-28 03:33:13,419 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-28 03:33:13,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1218 events. 125/1218 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7648 event pairs, 54 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1372. Up to 170 conditions per place. [2024-11-28 03:33:13,430 INFO L140 encePairwiseOnDemand]: 266/277 looper letters, 23 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2024-11-28 03:33:13,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 584 flow [2024-11-28 03:33:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-11-28 03:33:13,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910950661853189 [2024-11-28 03:33:13,434 INFO L175 Difference]: Start difference. First operand has 256 places, 258 transitions, 524 flow. Second operand 3 states and 757 transitions. [2024-11-28 03:33:13,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 584 flow [2024-11-28 03:33:13,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 259 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:13,443 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 544 flow [2024-11-28 03:33:13,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-11-28 03:33:13,445 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2024-11-28 03:33:13,445 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 544 flow [2024-11-28 03:33:13,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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) [2024-11-28 03:33:13,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:13,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:13,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:33:13,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -585834753, now seen corresponding path program 1 times [2024-11-28 03:33:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572907536] [2024-11-28 03:33:13,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572907536] [2024-11-28 03:33:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572907536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:13,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420440317] [2024-11-28 03:33:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:13,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:13,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:13,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-28 03:33:13,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 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) [2024-11-28 03:33:13,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:13,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-28 03:33:13,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:13,785 INFO L124 PetriNetUnfolderBase]: 79/1078 cut-off events. [2024-11-28 03:33:13,785 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-28 03:33:13,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1078 events. 79/1078 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6072 event pairs, 24 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1038. Up to 82 conditions per place. [2024-11-28 03:33:13,795 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 15 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-11-28 03:33:13,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 255 transitions, 576 flow [2024-11-28 03:33:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2024-11-28 03:33:13,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.924187725631769 [2024-11-28 03:33:13,801 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 544 flow. Second operand 3 states and 768 transitions. [2024-11-28 03:33:13,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 255 transitions, 576 flow [2024-11-28 03:33:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 255 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:13,808 INFO L231 Difference]: Finished difference. Result has 252 places, 255 transitions, 536 flow [2024-11-28 03:33:13,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=252, PETRI_TRANSITIONS=255} [2024-11-28 03:33:13,810 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2024-11-28 03:33:13,811 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 255 transitions, 536 flow [2024-11-28 03:33:13,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 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) [2024-11-28 03:33:13,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:13,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:13,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:33:13,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1711213442, now seen corresponding path program 1 times [2024-11-28 03:33:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004672198] [2024-11-28 03:33:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004672198] [2024-11-28 03:33:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004672198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90163826] [2024-11-28 03:33:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:13,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:13,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:13,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:13,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-28 03:33:13,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 255 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2024-11-28 03:33:13,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:13,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-28 03:33:13,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:14,149 INFO L124 PetriNetUnfolderBase]: 63/839 cut-off events. [2024-11-28 03:33:14,150 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-28 03:33:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 839 events. 63/839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3974 event pairs, 22 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 887. Up to 69 conditions per place. [2024-11-28 03:33:14,157 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 13 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-11-28 03:33:14,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 564 flow [2024-11-28 03:33:14,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-28 03:33:14,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-28 03:33:14,162 INFO L175 Difference]: Start difference. First operand has 252 places, 255 transitions, 536 flow. Second operand 3 states and 769 transitions. [2024-11-28 03:33:14,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 564 flow [2024-11-28 03:33:14,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:14,170 INFO L231 Difference]: Finished difference. Result has 251 places, 254 transitions, 534 flow [2024-11-28 03:33:14,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=251, PETRI_TRANSITIONS=254} [2024-11-28 03:33:14,171 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -12 predicate places. [2024-11-28 03:33:14,173 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 254 transitions, 534 flow [2024-11-28 03:33:14,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2024-11-28 03:33:14,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:14,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:33:14,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:14,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1067835431, now seen corresponding path program 1 times [2024-11-28 03:33:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173001934] [2024-11-28 03:33:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:14,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:14,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173001934] [2024-11-28 03:33:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173001934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758553772] [2024-11-28 03:33:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:14,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:14,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:14,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:14,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-28 03:33:14,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2024-11-28 03:33:14,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:14,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-28 03:33:14,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:14,499 INFO L124 PetriNetUnfolderBase]: 68/918 cut-off events. [2024-11-28 03:33:14,500 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-28 03:33:14,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 918 events. 68/918 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4597 event pairs, 22 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 961. Up to 71 conditions per place. [2024-11-28 03:33:14,506 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 13 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-11-28 03:33:14,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 253 transitions, 562 flow [2024-11-28 03:33:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-28 03:33:14,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-28 03:33:14,510 INFO L175 Difference]: Start difference. First operand has 251 places, 254 transitions, 534 flow. Second operand 3 states and 769 transitions. [2024-11-28 03:33:14,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 253 transitions, 562 flow [2024-11-28 03:33:14,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 253 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:14,515 INFO L231 Difference]: Finished difference. Result has 250 places, 253 transitions, 532 flow [2024-11-28 03:33:14,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=250, PETRI_TRANSITIONS=253} [2024-11-28 03:33:14,517 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-28 03:33:14,518 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 253 transitions, 532 flow [2024-11-28 03:33:14,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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) [2024-11-28 03:33:14,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:14,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:14,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:33:14,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:14,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1115557869, now seen corresponding path program 1 times [2024-11-28 03:33:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962371309] [2024-11-28 03:33:14,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962371309] [2024-11-28 03:33:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962371309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:14,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:14,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050185806] [2024-11-28 03:33:14,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:14,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:14,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:14,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:14,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 277 [2024-11-28 03:33:14,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 253 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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) [2024-11-28 03:33:14,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:14,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 277 [2024-11-28 03:33:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:14,918 INFO L124 PetriNetUnfolderBase]: 110/1251 cut-off events. [2024-11-28 03:33:14,918 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 03:33:14,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1251 events. 110/1251 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7206 event pairs, 20 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1378. Up to 87 conditions per place. [2024-11-28 03:33:14,930 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 4 changer transitions 0/263 dead transitions. [2024-11-28 03:33:14,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 263 transitions, 601 flow [2024-11-28 03:33:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2024-11-28 03:33:14,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9494584837545126 [2024-11-28 03:33:14,934 INFO L175 Difference]: Start difference. First operand has 250 places, 253 transitions, 532 flow. Second operand 3 states and 789 transitions. [2024-11-28 03:33:14,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 263 transitions, 601 flow [2024-11-28 03:33:14,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 263 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:14,940 INFO L231 Difference]: Finished difference. Result has 252 places, 257 transitions, 562 flow [2024-11-28 03:33:14,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=252, PETRI_TRANSITIONS=257} [2024-11-28 03:33:14,943 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2024-11-28 03:33:14,943 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 257 transitions, 562 flow [2024-11-28 03:33:14,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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) [2024-11-28 03:33:14,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:14,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:14,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:33:14,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1291411475, now seen corresponding path program 1 times [2024-11-28 03:33:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614471569] [2024-11-28 03:33:14,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:15,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:15,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614471569] [2024-11-28 03:33:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614471569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593564787] [2024-11-28 03:33:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:15,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:15,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:15,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:15,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 277 [2024-11-28 03:33:15,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 257 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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) [2024-11-28 03:33:15,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:15,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 277 [2024-11-28 03:33:15,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:15,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][247], [75#L762-4true, 271#true, 298#true, 32#L726-2true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 293#true, 258#L750-2true]) [2024-11-28 03:33:15,380 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-28 03:33:15,380 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-28 03:33:15,383 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-28 03:33:15,383 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-28 03:33:15,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][247], [136#L763-1true, 271#true, 298#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 293#true, 258#L750-2true]) [2024-11-28 03:33:15,391 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-28 03:33:15,391 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-28 03:33:15,391 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-28 03:33:15,391 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-28 03:33:15,463 INFO L124 PetriNetUnfolderBase]: 217/2261 cut-off events. [2024-11-28 03:33:15,463 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-28 03:33:15,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 2261 events. 217/2261 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16393 event pairs, 41 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2483. Up to 161 conditions per place. [2024-11-28 03:33:15,483 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 18 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2024-11-28 03:33:15,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 266 transitions, 625 flow [2024-11-28 03:33:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2024-11-28 03:33:15,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482551143200962 [2024-11-28 03:33:15,490 INFO L175 Difference]: Start difference. First operand has 252 places, 257 transitions, 562 flow. Second operand 3 states and 788 transitions. [2024-11-28 03:33:15,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 266 transitions, 625 flow [2024-11-28 03:33:15,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 266 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:15,502 INFO L231 Difference]: Finished difference. Result has 254 places, 261 transitions, 588 flow [2024-11-28 03:33:15,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=254, PETRI_TRANSITIONS=261} [2024-11-28 03:33:15,503 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -9 predicate places. [2024-11-28 03:33:15,507 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 261 transitions, 588 flow [2024-11-28 03:33:15,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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) [2024-11-28 03:33:15,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:15,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:15,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:33:15,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1640255901, now seen corresponding path program 1 times [2024-11-28 03:33:15,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:15,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113503470] [2024-11-28 03:33:15,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:15,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113503470] [2024-11-28 03:33:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113503470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021610258] [2024-11-28 03:33:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:15,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:15,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:15,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 277 [2024-11-28 03:33:15,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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) [2024-11-28 03:33:15,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:15,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 277 [2024-11-28 03:33:15,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:16,373 INFO L124 PetriNetUnfolderBase]: 464/4095 cut-off events. [2024-11-28 03:33:16,374 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-28 03:33:16,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 4095 events. 464/4095 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 38272 event pairs, 115 based on Foata normal form. 0/3529 useless extension candidates. Maximal degree in co-relation 4787. Up to 523 conditions per place. [2024-11-28 03:33:16,403 INFO L140 encePairwiseOnDemand]: 270/277 looper letters, 24 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-28 03:33:16,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 264 transitions, 649 flow [2024-11-28 03:33:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2024-11-28 03:33:16,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9217809867629362 [2024-11-28 03:33:16,406 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 588 flow. Second operand 3 states and 766 transitions. [2024-11-28 03:33:16,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 264 transitions, 649 flow [2024-11-28 03:33:16,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 264 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:16,415 INFO L231 Difference]: Finished difference. Result has 250 places, 258 transitions, 584 flow [2024-11-28 03:33:16,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=250, PETRI_TRANSITIONS=258} [2024-11-28 03:33:16,416 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-28 03:33:16,416 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 258 transitions, 584 flow [2024-11-28 03:33:16,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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) [2024-11-28 03:33:16,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:16,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:33:16,417 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash 886365822, now seen corresponding path program 1 times [2024-11-28 03:33:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459666039] [2024-11-28 03:33:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459666039] [2024-11-28 03:33:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459666039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:16,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:16,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717086] [2024-11-28 03:33:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:16,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:16,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:16,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:16,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-28 03:33:16,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 258 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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) [2024-11-28 03:33:16,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:16,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-28 03:33:16,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:17,446 INFO L124 PetriNetUnfolderBase]: 668/5213 cut-off events. [2024-11-28 03:33:17,447 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-28 03:33:17,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 5213 events. 668/5213 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 49714 event pairs, 119 based on Foata normal form. 0/4602 useless extension candidates. Maximal degree in co-relation 6429. Up to 598 conditions per place. [2024-11-28 03:33:17,500 INFO L140 encePairwiseOnDemand]: 270/277 looper letters, 18 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2024-11-28 03:33:17,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 637 flow [2024-11-28 03:33:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-28 03:33:17,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-28 03:33:17,503 INFO L175 Difference]: Start difference. First operand has 250 places, 258 transitions, 584 flow. Second operand 3 states and 775 transitions. [2024-11-28 03:33:17,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 262 transitions, 637 flow [2024-11-28 03:33:17,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 262 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:33:17,510 INFO L231 Difference]: Finished difference. Result has 250 places, 257 transitions, 598 flow [2024-11-28 03:33:17,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=250, PETRI_TRANSITIONS=257} [2024-11-28 03:33:17,511 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-28 03:33:17,513 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 257 transitions, 598 flow [2024-11-28 03:33:17,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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) [2024-11-28 03:33:17,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:17,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:17,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:33:17,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1930276853, now seen corresponding path program 1 times [2024-11-28 03:33:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175725778] [2024-11-28 03:33:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175725778] [2024-11-28 03:33:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175725778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954319343] [2024-11-28 03:33:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:17,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:17,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:17,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-28 03:33:17,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 257 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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) [2024-11-28 03:33:17,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:17,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-28 03:33:17,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:18,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [75#L762-4true, 271#true, Black: 303#true, Black: 307#true, 32#L726-2true, 309#(= |#race~first~0| 0), Black: 295#(= |#race~send~0| 0), Black: 279#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 258#L750-2true]) [2024-11-28 03:33:18,313 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-28 03:33:18,313 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:18,313 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:18,313 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:18,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [136#L763-1true, 271#true, Black: 303#true, Black: 307#true, 309#(= |#race~first~0| 0), Black: 295#(= |#race~send~0| 0), Black: 279#true, 311#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 258#L750-2true]) [2024-11-28 03:33:18,337 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-28 03:33:18,337 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-28 03:33:18,337 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-28 03:33:18,337 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-28 03:33:18,443 INFO L124 PetriNetUnfolderBase]: 685/4850 cut-off events. [2024-11-28 03:33:18,443 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-28 03:33:18,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 4850 events. 685/4850 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 44903 event pairs, 291 based on Foata normal form. 0/4248 useless extension candidates. Maximal degree in co-relation 6198. Up to 816 conditions per place. [2024-11-28 03:33:18,481 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 18 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2024-11-28 03:33:18,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 650 flow [2024-11-28 03:33:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-28 03:33:18,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-28 03:33:18,484 INFO L175 Difference]: Start difference. First operand has 250 places, 257 transitions, 598 flow. Second operand 3 states and 775 transitions. [2024-11-28 03:33:18,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 650 flow [2024-11-28 03:33:18,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 261 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:33:18,490 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 612 flow [2024-11-28 03:33:18,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2024-11-28 03:33:18,491 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2024-11-28 03:33:18,491 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 612 flow [2024-11-28 03:33:18,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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) [2024-11-28 03:33:18,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:18,492 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:18,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:33:18,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:18,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 852488102, now seen corresponding path program 1 times [2024-11-28 03:33:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691790922] [2024-11-28 03:33:18,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:18,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691790922] [2024-11-28 03:33:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691790922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:18,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341720047] [2024-11-28 03:33:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:18,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:18,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:18,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:18,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 277 [2024-11-28 03:33:18,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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) [2024-11-28 03:33:18,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:18,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 277 [2024-11-28 03:33:18,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:19,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [75#L762-4true, 316#true, 32#L726-2true, Black: 295#(= |#race~send~0| 0), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:19,570 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-28 03:33:19,570 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:19,570 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:19,571 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:19,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [136#L763-1true, Black: 303#true, 271#true, 316#true, Black: 307#true, Black: 295#(= |#race~send~0| 0), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 258#L750-2true]) [2024-11-28 03:33:19,601 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-28 03:33:19,601 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-28 03:33:19,602 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-28 03:33:19,602 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-28 03:33:19,726 INFO L124 PetriNetUnfolderBase]: 750/5301 cut-off events. [2024-11-28 03:33:19,726 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-11-28 03:33:19,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 5301 events. 750/5301 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 51232 event pairs, 284 based on Foata normal form. 0/4692 useless extension candidates. Maximal degree in co-relation 6889. Up to 853 conditions per place. [2024-11-28 03:33:19,764 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 21 selfloop transitions, 4 changer transitions 0/264 dead transitions. [2024-11-28 03:33:19,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 264 transitions, 676 flow [2024-11-28 03:33:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2024-11-28 03:33:19,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9302045728038508 [2024-11-28 03:33:19,767 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 612 flow. Second operand 3 states and 773 transitions. [2024-11-28 03:33:19,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 264 transitions, 676 flow [2024-11-28 03:33:19,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 264 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:19,776 INFO L231 Difference]: Finished difference. Result has 255 places, 261 transitions, 636 flow [2024-11-28 03:33:19,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=255, PETRI_TRANSITIONS=261} [2024-11-28 03:33:19,777 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -8 predicate places. [2024-11-28 03:33:19,777 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 261 transitions, 636 flow [2024-11-28 03:33:19,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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) [2024-11-28 03:33:19,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:19,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:19,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:33:19,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:19,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1174483711, now seen corresponding path program 1 times [2024-11-28 03:33:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:19,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352487390] [2024-11-28 03:33:19,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352487390] [2024-11-28 03:33:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352487390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:19,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:19,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689017490] [2024-11-28 03:33:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:19,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:19,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:19,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-28 03:33:19,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 261 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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) [2024-11-28 03:33:19,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:19,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-28 03:33:19,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:20,672 INFO L124 PetriNetUnfolderBase]: 759/5667 cut-off events. [2024-11-28 03:33:20,672 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-11-28 03:33:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 5667 events. 759/5667 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 54449 event pairs, 306 based on Foata normal form. 0/5018 useless extension candidates. Maximal degree in co-relation 7581. Up to 945 conditions per place. [2024-11-28 03:33:20,694 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 18 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2024-11-28 03:33:20,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 264 transitions, 683 flow [2024-11-28 03:33:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-28 03:33:20,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-28 03:33:20,697 INFO L175 Difference]: Start difference. First operand has 255 places, 261 transitions, 636 flow. Second operand 3 states and 775 transitions. [2024-11-28 03:33:20,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 264 transitions, 683 flow [2024-11-28 03:33:20,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 264 transitions, 673 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:20,704 INFO L231 Difference]: Finished difference. Result has 257 places, 261 transitions, 640 flow [2024-11-28 03:33:20,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=257, PETRI_TRANSITIONS=261} [2024-11-28 03:33:20,705 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2024-11-28 03:33:20,705 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 261 transitions, 640 flow [2024-11-28 03:33:20,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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) [2024-11-28 03:33:20,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:20,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:20,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:33:20,706 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:20,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:20,707 INFO L85 PathProgramCache]: Analyzing trace with hash -253477328, now seen corresponding path program 1 times [2024-11-28 03:33:20,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:20,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16995921] [2024-11-28 03:33:20,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:20,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16995921] [2024-11-28 03:33:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16995921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:20,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:20,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:20,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212410544] [2024-11-28 03:33:20,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:20,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:20,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:20,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:20,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:20,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-28 03:33:20,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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) [2024-11-28 03:33:20,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:20,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-28 03:33:20,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:21,613 INFO L124 PetriNetUnfolderBase]: 519/4514 cut-off events. [2024-11-28 03:33:21,613 INFO L125 PetriNetUnfolderBase]: For 229/290 co-relation queries the response was YES. [2024-11-28 03:33:21,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6257 conditions, 4514 events. 519/4514 cut-off events. For 229/290 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 41157 event pairs, 169 based on Foata normal form. 1/4056 useless extension candidates. Maximal degree in co-relation 5956. Up to 612 conditions per place. [2024-11-28 03:33:21,644 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2024-11-28 03:33:21,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 267 transitions, 704 flow [2024-11-28 03:33:21,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-28 03:33:21,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398315282791817 [2024-11-28 03:33:21,647 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 640 flow. Second operand 3 states and 781 transitions. [2024-11-28 03:33:21,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 267 transitions, 704 flow [2024-11-28 03:33:21,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 267 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:21,654 INFO L231 Difference]: Finished difference. Result has 259 places, 264 transitions, 670 flow [2024-11-28 03:33:21,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=259, PETRI_TRANSITIONS=264} [2024-11-28 03:33:21,655 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -4 predicate places. [2024-11-28 03:33:21,655 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 264 transitions, 670 flow [2024-11-28 03:33:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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) [2024-11-28 03:33:21,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:21,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:21,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:33:21,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:21,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:21,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1043194417, now seen corresponding path program 1 times [2024-11-28 03:33:21,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:21,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591523147] [2024-11-28 03:33:21,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:21,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591523147] [2024-11-28 03:33:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591523147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634759813] [2024-11-28 03:33:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:21,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:21,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:21,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:21,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-28 03:33:21,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 264 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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) [2024-11-28 03:33:21,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:21,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-28 03:33:21,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:22,447 INFO L124 PetriNetUnfolderBase]: 666/5678 cut-off events. [2024-11-28 03:33:22,447 INFO L125 PetriNetUnfolderBase]: For 377/382 co-relation queries the response was YES. [2024-11-28 03:33:22,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 5678 events. 666/5678 cut-off events. For 377/382 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 55293 event pairs, 200 based on Foata normal form. 1/5116 useless extension candidates. Maximal degree in co-relation 7724. Up to 765 conditions per place. [2024-11-28 03:33:22,476 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2024-11-28 03:33:22,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 733 flow [2024-11-28 03:33:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-28 03:33:22,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9398315282791817 [2024-11-28 03:33:22,479 INFO L175 Difference]: Start difference. First operand has 259 places, 264 transitions, 670 flow. Second operand 3 states and 781 transitions. [2024-11-28 03:33:22,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 733 flow [2024-11-28 03:33:22,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 270 transitions, 721 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:22,487 INFO L231 Difference]: Finished difference. Result has 261 places, 267 transitions, 694 flow [2024-11-28 03:33:22,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=261, PETRI_TRANSITIONS=267} [2024-11-28 03:33:22,488 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -2 predicate places. [2024-11-28 03:33:22,488 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 267 transitions, 694 flow [2024-11-28 03:33:22,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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) [2024-11-28 03:33:22,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:22,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:33:22,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:22,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1698875296, now seen corresponding path program 1 times [2024-11-28 03:33:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493749693] [2024-11-28 03:33:22,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:22,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493749693] [2024-11-28 03:33:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493749693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:22,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:22,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634765133] [2024-11-28 03:33:22,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:22,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:22,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:22,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:22,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:22,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-28 03:33:22,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 267 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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) [2024-11-28 03:33:22,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:22,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-28 03:33:22,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:23,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 32#L726-2true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:23,328 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-28 03:33:23,328 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:23,328 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:23,329 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:23,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:23,361 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-28 03:33:23,362 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-28 03:33:23,362 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-28 03:33:23,362 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-28 03:33:23,526 INFO L124 PetriNetUnfolderBase]: 705/6114 cut-off events. [2024-11-28 03:33:23,526 INFO L125 PetriNetUnfolderBase]: For 433/436 co-relation queries the response was YES. [2024-11-28 03:33:23,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 6114 events. 705/6114 cut-off events. For 433/436 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 61128 event pairs, 243 based on Foata normal form. 0/5562 useless extension candidates. Maximal degree in co-relation 8425. Up to 869 conditions per place. [2024-11-28 03:33:23,565 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 19 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-28 03:33:23,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 269 transitions, 741 flow [2024-11-28 03:33:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2024-11-28 03:33:23,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927797833935018 [2024-11-28 03:33:23,569 INFO L175 Difference]: Start difference. First operand has 261 places, 267 transitions, 694 flow. Second operand 3 states and 771 transitions. [2024-11-28 03:33:23,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 269 transitions, 741 flow [2024-11-28 03:33:23,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 269 transitions, 729 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:23,582 INFO L231 Difference]: Finished difference. Result has 260 places, 266 transitions, 684 flow [2024-11-28 03:33:23,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=260, PETRI_TRANSITIONS=266} [2024-11-28 03:33:23,583 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -3 predicate places. [2024-11-28 03:33:23,583 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 266 transitions, 684 flow [2024-11-28 03:33:23,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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) [2024-11-28 03:33:23,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:23,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:23,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:33:23,584 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:23,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1163285869, now seen corresponding path program 1 times [2024-11-28 03:33:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326735235] [2024-11-28 03:33:23,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:23,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326735235] [2024-11-28 03:33:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326735235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:23,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334457018] [2024-11-28 03:33:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:23,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:23,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:23,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:23,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-28 03:33:23,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 266 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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) [2024-11-28 03:33:23,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:23,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-28 03:33:23,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:24,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 32#L726-2true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:24,394 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-28 03:33:24,394 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:24,394 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:24,395 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:24,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:24,431 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-28 03:33:24,431 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-28 03:33:24,431 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-28 03:33:24,431 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-28 03:33:24,595 INFO L124 PetriNetUnfolderBase]: 721/6192 cut-off events. [2024-11-28 03:33:24,595 INFO L125 PetriNetUnfolderBase]: For 694/719 co-relation queries the response was YES. [2024-11-28 03:33:24,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 6192 events. 721/6192 cut-off events. For 694/719 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 61526 event pairs, 185 based on Foata normal form. 5/5618 useless extension candidates. Maximal degree in co-relation 8612. Up to 804 conditions per place. [2024-11-28 03:33:24,644 INFO L140 encePairwiseOnDemand]: 271/277 looper letters, 19 selfloop transitions, 9 changer transitions 0/275 dead transitions. [2024-11-28 03:33:24,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 275 transitions, 772 flow [2024-11-28 03:33:24,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:24,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-11-28 03:33:24,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.941034897713598 [2024-11-28 03:33:24,647 INFO L175 Difference]: Start difference. First operand has 260 places, 266 transitions, 684 flow. Second operand 3 states and 782 transitions. [2024-11-28 03:33:24,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 275 transitions, 772 flow [2024-11-28 03:33:24,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 275 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:24,656 INFO L231 Difference]: Finished difference. Result has 262 places, 272 transitions, 754 flow [2024-11-28 03:33:24,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=262, PETRI_TRANSITIONS=272} [2024-11-28 03:33:24,658 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -1 predicate places. [2024-11-28 03:33:24,658 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 272 transitions, 754 flow [2024-11-28 03:33:24,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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) [2024-11-28 03:33:24,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:24,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:24,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:33:24,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:24,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1076350577, now seen corresponding path program 1 times [2024-11-28 03:33:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103640714] [2024-11-28 03:33:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:24,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103640714] [2024-11-28 03:33:24,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103640714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:24,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:24,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:24,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205889547] [2024-11-28 03:33:24,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:24,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:24,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:24,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:24,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:24,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-28 03:33:24,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 272 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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) [2024-11-28 03:33:24,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:24,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-28 03:33:24,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:25,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 196#L695-7true]) [2024-11-28 03:33:25,044 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-28 03:33:25,044 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:25,044 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:25,044 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:25,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 196#L695-7true]) [2024-11-28 03:33:25,101 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-28 03:33:25,102 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:25,102 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:25,102 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:25,102 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 196#L695-7true]) [2024-11-28 03:33:25,102 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-28 03:33:25,102 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:25,103 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:25,103 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-28 03:33:25,103 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:25,119 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 196#L695-7true]) [2024-11-28 03:33:25,119 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-28 03:33:25,119 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:25,119 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:25,120 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:25,120 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:25,660 INFO L124 PetriNetUnfolderBase]: 834/6436 cut-off events. [2024-11-28 03:33:25,660 INFO L125 PetriNetUnfolderBase]: For 1020/1054 co-relation queries the response was YES. [2024-11-28 03:33:25,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9609 conditions, 6436 events. 834/6436 cut-off events. For 1020/1054 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 64386 event pairs, 194 based on Foata normal form. 5/5830 useless extension candidates. Maximal degree in co-relation 9312. Up to 869 conditions per place. [2024-11-28 03:33:25,689 INFO L140 encePairwiseOnDemand]: 271/277 looper letters, 19 selfloop transitions, 9 changer transitions 0/281 dead transitions. [2024-11-28 03:33:25,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 281 transitions, 841 flow [2024-11-28 03:33:25,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-11-28 03:33:25,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.941034897713598 [2024-11-28 03:33:25,692 INFO L175 Difference]: Start difference. First operand has 262 places, 272 transitions, 754 flow. Second operand 3 states and 782 transitions. [2024-11-28 03:33:25,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 281 transitions, 841 flow [2024-11-28 03:33:25,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 281 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:25,703 INFO L231 Difference]: Finished difference. Result has 264 places, 278 transitions, 810 flow [2024-11-28 03:33:25,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=264, PETRI_TRANSITIONS=278} [2024-11-28 03:33:25,704 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 1 predicate places. [2024-11-28 03:33:25,704 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 278 transitions, 810 flow [2024-11-28 03:33:25,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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) [2024-11-28 03:33:25,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:25,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:25,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:33:25,705 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1274494097, now seen corresponding path program 1 times [2024-11-28 03:33:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89827706] [2024-11-28 03:33:25,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:25,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:25,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89827706] [2024-11-28 03:33:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89827706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:25,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:25,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340723196] [2024-11-28 03:33:25,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:25,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:25,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:25,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:25,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:25,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 277 [2024-11-28 03:33:25,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 278 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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) [2024-11-28 03:33:25,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:25,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 277 [2024-11-28 03:33:25,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:26,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][218], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, 248#L748-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 263#L727-1true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 271#true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-28 03:33:26,546 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-28 03:33:26,546 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:26,546 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:26,546 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:26,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 32#L726-2true, Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 271#true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:26,669 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-28 03:33:26,669 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:26,670 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:26,670 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:26,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, 271#true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:26,706 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-28 03:33:26,706 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-28 03:33:26,706 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-28 03:33:26,706 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-28 03:33:26,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][260], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 71#L731-3true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 339#true, Black: 307#true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-28 03:33:26,908 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-11-28 03:33:26,908 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-28 03:33:26,908 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-28 03:33:26,908 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-28 03:33:26,952 INFO L124 PetriNetUnfolderBase]: 1223/8600 cut-off events. [2024-11-28 03:33:26,952 INFO L125 PetriNetUnfolderBase]: For 1479/1535 co-relation queries the response was YES. [2024-11-28 03:33:26,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13458 conditions, 8600 events. 1223/8600 cut-off events. For 1479/1535 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 90205 event pairs, 360 based on Foata normal form. 6/7944 useless extension candidates. Maximal degree in co-relation 13114. Up to 1437 conditions per place. [2024-11-28 03:33:27,009 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 25 selfloop transitions, 5 changer transitions 0/285 dead transitions. [2024-11-28 03:33:27,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 285 transitions, 890 flow [2024-11-28 03:33:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-28 03:33:27,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-28 03:33:27,012 INFO L175 Difference]: Start difference. First operand has 264 places, 278 transitions, 810 flow. Second operand 3 states and 769 transitions. [2024-11-28 03:33:27,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 285 transitions, 890 flow [2024-11-28 03:33:27,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 285 transitions, 872 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:27,027 INFO L231 Difference]: Finished difference. Result has 266 places, 282 transitions, 834 flow [2024-11-28 03:33:27,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=266, PETRI_TRANSITIONS=282} [2024-11-28 03:33:27,027 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 3 predicate places. [2024-11-28 03:33:27,028 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 282 transitions, 834 flow [2024-11-28 03:33:27,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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) [2024-11-28 03:33:27,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:27,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:27,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:33:27,029 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:27,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:27,029 INFO L85 PathProgramCache]: Analyzing trace with hash 589450358, now seen corresponding path program 1 times [2024-11-28 03:33:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892613714] [2024-11-28 03:33:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:27,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:27,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892613714] [2024-11-28 03:33:27,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892613714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:27,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:27,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:33:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520443461] [2024-11-28 03:33:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:27,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:27,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:27,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:27,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-28 03:33:27,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 282 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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) [2024-11-28 03:33:27,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:27,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-28 03:33:27,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:27,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 196#L695-7true]) [2024-11-28 03:33:27,640 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-28 03:33:27,640 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:27,640 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:27,640 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:27,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 196#L695-7true]) [2024-11-28 03:33:27,655 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-28 03:33:27,655 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:27,655 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:27,655 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-28 03:33:27,696 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 196#L695-7true]) [2024-11-28 03:33:27,696 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-28 03:33:27,696 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-28 03:33:27,696 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-28 03:33:27,696 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-28 03:33:27,696 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-28 03:33:27,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][218], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, 248#L748-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 263#L727-1true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-28 03:33:27,969 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-28 03:33:27,969 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:27,969 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:27,969 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:28,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 32#L726-2true, 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:28,169 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-28 03:33:28,169 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-28 03:33:28,169 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-28 03:33:28,169 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-28 03:33:28,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-28 03:33:28,235 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-28 03:33:28,235 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-28 03:33:28,235 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-28 03:33:28,235 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-28 03:33:28,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][244], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 71#L731-3true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 339#true, 354#true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-28 03:33:28,363 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-28 03:33:28,363 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-28 03:33:28,363 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-28 03:33:28,363 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-28 03:33:28,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][244], [Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 75#L762-4true, Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 71#L731-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 271#true, Black: 303#true, Black: 339#true, Black: 307#true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 356#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), Black: 279#true]) [2024-11-28 03:33:28,506 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2024-11-28 03:33:28,506 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-28 03:33:28,506 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-28 03:33:28,506 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2024-11-28 03:33:28,559 INFO L124 PetriNetUnfolderBase]: 1162/10052 cut-off events. [2024-11-28 03:33:28,559 INFO L125 PetriNetUnfolderBase]: For 1890/2011 co-relation queries the response was YES. [2024-11-28 03:33:28,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15358 conditions, 10052 events. 1162/10052 cut-off events. For 1890/2011 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 112868 event pairs, 192 based on Foata normal form. 10/9263 useless extension candidates. Maximal degree in co-relation 15062. Up to 745 conditions per place. [2024-11-28 03:33:28,624 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/290 dead transitions. [2024-11-28 03:33:28,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 290 transitions, 901 flow [2024-11-28 03:33:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2024-11-28 03:33:28,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9422382671480144 [2024-11-28 03:33:28,627 INFO L175 Difference]: Start difference. First operand has 266 places, 282 transitions, 834 flow. Second operand 3 states and 783 transitions. [2024-11-28 03:33:28,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 290 transitions, 901 flow [2024-11-28 03:33:28,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 290 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:33:28,640 INFO L231 Difference]: Finished difference. Result has 268 places, 285 transitions, 860 flow [2024-11-28 03:33:28,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=268, PETRI_TRANSITIONS=285} [2024-11-28 03:33:28,641 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-28 03:33:28,642 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 285 transitions, 860 flow [2024-11-28 03:33:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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) [2024-11-28 03:33:28,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:33:28,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:28,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:33:28,643 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-28 03:33:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:33:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1578615859, now seen corresponding path program 1 times [2024-11-28 03:33:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:33:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68735431] [2024-11-28 03:33:28,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:33:28,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:33:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:33:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:33:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:33:28,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68735431] [2024-11-28 03:33:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68735431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:33:28,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:33:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:33:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579887277] [2024-11-28 03:33:28,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:33:28,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:33:28,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:33:28,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:33:28,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:33:28,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 277 [2024-11-28 03:33:28,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 285 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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) [2024-11-28 03:33:28,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:33:28,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 277 [2024-11-28 03:33:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:33:29,043 INFO L124 PetriNetUnfolderBase]: 151/1883 cut-off events. [2024-11-28 03:33:29,044 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2024-11-28 03:33:29,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1883 events. 151/1883 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13628 event pairs, 17 based on Foata normal form. 40/1816 useless extension candidates. Maximal degree in co-relation 2100. Up to 98 conditions per place. [2024-11-28 03:33:29,051 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 0 selfloop transitions, 0 changer transitions 244/244 dead transitions. [2024-11-28 03:33:29,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 244 transitions, 669 flow [2024-11-28 03:33:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:33:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:33:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2024-11-28 03:33:29,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950661853188929 [2024-11-28 03:33:29,053 INFO L175 Difference]: Start difference. First operand has 268 places, 285 transitions, 860 flow. Second operand 3 states and 790 transitions. [2024-11-28 03:33:29,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 244 transitions, 669 flow [2024-11-28 03:33:29,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 585 flow, removed 21 selfloop flow, removed 16 redundant places. [2024-11-28 03:33:29,060 INFO L231 Difference]: Finished difference. Result has 244 places, 0 transitions, 0 flow [2024-11-28 03:33:29,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=244, PETRI_TRANSITIONS=0} [2024-11-28 03:33:29,061 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -19 predicate places. [2024-11-28 03:33:29,061 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 0 transitions, 0 flow [2024-11-28 03:33:29,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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) [2024-11-28 03:33:29,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2024-11-28 03:33:29,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2024-11-28 03:33:29,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2024-11-28 03:33:29,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2024-11-28 03:33:29,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2024-11-28 03:33:29,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2024-11-28 03:33:29,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2024-11-28 03:33:29,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2024-11-28 03:33:29,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2024-11-28 03:33:29,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2024-11-28 03:33:29,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2024-11-28 03:33:29,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2024-11-28 03:33:29,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2024-11-28 03:33:29,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:33:29,070 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:33:29,077 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:33:29,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:33:29,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:33:29 BasicIcfg [2024-11-28 03:33:29,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:33:29,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:33:29,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:33:29,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:33:29,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:33:11" (3/4) ... [2024-11-28 03:33:29,087 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 03:33:29,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2024-11-28 03:33:29,091 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2024-11-28 03:33:29,094 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-28 03:33:29,095 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-28 03:33:29,095 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 03:33:29,096 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 03:33:29,175 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:33:29,175 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:33:29,175 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:33:29,176 INFO L158 Benchmark]: Toolchain (without parser) took 19762.15ms. Allocated memory was 117.4MB in the beginning and 897.6MB in the end (delta: 780.1MB). Free memory was 92.1MB in the beginning and 298.4MB in the end (delta: -206.2MB). Peak memory consumption was 570.4MB. Max. memory is 16.1GB. [2024-11-28 03:33:29,177 INFO L158 Benchmark]: CDTParser took 1.57ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:33:29,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.66ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 70.9MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:33:29,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.02ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 68.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:33:29,178 INFO L158 Benchmark]: Boogie Preprocessor took 63.71ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:33:29,179 INFO L158 Benchmark]: RCFGBuilder took 933.39ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 43.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 03:33:29,180 INFO L158 Benchmark]: TraceAbstraction took 18003.18ms. Allocated memory was 117.4MB in the beginning and 897.6MB in the end (delta: 780.1MB). Free memory was 42.7MB in the beginning and 302.6MB in the end (delta: -259.9MB). Peak memory consumption was 528.4MB. Max. memory is 16.1GB. [2024-11-28 03:33:29,180 INFO L158 Benchmark]: Witness Printer took 90.75ms. Allocated memory is still 897.6MB. Free memory was 302.6MB in the beginning and 298.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:33:29,182 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.57ms. Allocated memory is still 117.4MB. Free memory was 72.2MB in the beginning and 72.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 596.66ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 70.9MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.02ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 68.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.71ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 66.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 933.39ms. Allocated memory is still 117.4MB. Free memory was 66.7MB in the beginning and 43.4MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18003.18ms. Allocated memory was 117.4MB in the beginning and 897.6MB in the end (delta: 780.1MB). Free memory was 42.7MB in the beginning and 302.6MB in the end (delta: -259.9MB). Peak memory consumption was 528.4MB. Max. memory is 16.1GB. * Witness Printer took 90.75ms. Allocated memory is still 897.6MB. Free memory was 302.6MB in the beginning and 298.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 731]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 747]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 748]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 54 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: 17.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 172 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=20, InterpolantAutomatonStates: 63, 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.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 03:33:29,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa937a7c-9c11-4ebc-88fb-b9a717b5eeee/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE