./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-15.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC --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 c250d04a54594f141e4a6230ba64a939d316d8b15028517201aca3da084476d7
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:39:08,394 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:39:08,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-11-24 01:39:08,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:39:08,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:39:08,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:39:08,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:39:08,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:39:08,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:39:08,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:39:08,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:39:08,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 01:39:08,535 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 01:39:08,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:39:08,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-11-24 01:39:08,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 01:39:08,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:39:08,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:39:08,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:39:08,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:39:08,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:39:08,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:39:08,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:39:08,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:39:08,540 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-24 01:39:08,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 01:39:08,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 01:39:08,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 01:39:08,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:39:08,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:39:08,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:39:08,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:39:08,541 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_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC
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 -> c250d04a54594f141e4a6230ba64a939d316d8b15028517201aca3da084476d7
[2024-11-24 01:39:08,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:39:08,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:39:08,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:39:08,840 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 01:39:08,841 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 01:39:08,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-deagle/airline-15.i
[2024-11-24 01:39:11,795 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/data/5bddfc3e7/41a77cc4390e44dda52baf5c30d05607/FLAG3f3def360
[2024-11-24 01:39:12,086 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 01:39:12,087 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/sv-benchmarks/c/pthread-deagle/airline-15.i
[2024-11-24 01:39:12,100 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/data/5bddfc3e7/41a77cc4390e44dda52baf5c30d05607/FLAG3f3def360
[2024-11-24 01:39:12,349 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/data/5bddfc3e7/41a77cc4390e44dda52baf5c30d05607
[2024-11-24 01:39:12,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:39:12,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:39:12,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:39:12,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:39:12,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:39:12,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ecaacb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12, skipping insertion in model container
[2024-11-24 01:39:12,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,399 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:39:12,756 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:39:12,764 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 01:39:12,808 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:39:12,848 INFO L204 MainTranslator]: Completed translation
[2024-11-24 01:39:12,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12 WrapperNode
[2024-11-24 01:39:12,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:39:12,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:39:12,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:39:12,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:39:12,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,890 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87
[2024-11-24 01:39:12,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:39:12,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:39:12,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:39:12,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:39:12,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:39:12,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:39:12,922 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:39:12,923 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:39:12,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (1/1) ...
[2024-11-24 01:39:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:39:12,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:39:12,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:39:12,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:39:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2024-11-24 01:39:12,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure salethread
[2024-11-24 01:39:12,988 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-24 01:39:12,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-24 01:39:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:39:12,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:39:12,990 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 01:39:13,111 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 01:39:13,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:39:13,358 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 01:39:13,358 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 01:39:13,398 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:39:13,399 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-24 01:39:13,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:39:13 BoogieIcfgContainer
[2024-11-24 01:39:13,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:39:13,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:39:13,403 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:39:13,408 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:39:13,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:39:12" (1/3) ...
[2024-11-24 01:39:13,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74edde0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:39:13, skipping insertion in model container
[2024-11-24 01:39:13,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:39:12" (2/3) ...
[2024-11-24 01:39:13,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74edde0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:39:13, skipping insertion in model container
[2024-11-24 01:39:13,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:39:13" (3/3) ...
[2024-11-24 01:39:13,411 INFO L128 eAbstractionObserver]: Analyzing ICFG airline-15.i
[2024-11-24 01:39:13,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:39:13,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG airline-15.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 10 error locations.
[2024-11-24 01:39:13,424 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 01:39:13,489 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-11-24 01:39:13,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 99 transitions, 205 flow
[2024-11-24 01:39:13,593 INFO L124 PetriNetUnfolderBase]: 11/144 cut-off events.
[2024-11-24 01:39:13,595 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-11-24 01:39:13,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 144 events. 11/144 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 305 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 70. Up to 4 conditions per place.
[2024-11-24 01:39:13,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 99 transitions, 205 flow
[2024-11-24 01:39:13,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 99 transitions, 205 flow
[2024-11-24 01:39:13,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:39:13,660 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;@2d7a1867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:39:13,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-11-24 01:39:13,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:39:13,673 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events.
[2024-11-24 01:39:13,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:39:13,673 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:13,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:39:13,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1631681624, now seen corresponding path program 1 times
[2024-11-24 01:39:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946028722]
[2024-11-24 01:39:13,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:13,831 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-24 01:39:13,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:13,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946028722]
[2024-11-24 01:39:13,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946028722] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:13,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:13,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:39:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116829341]
[2024-11-24 01:39:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:13,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-24 01:39:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:13,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-24 01:39:13,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-24 01:39:13,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 99
[2024-11-24 01:39:13,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 99 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-24 01:39:13,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:13,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 99
[2024-11-24 01:39:13,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:13,939 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events.
[2024-11-24 01:39:13,939 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES.
[2024-11-24 01:39:13,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 3/127 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 258 event pairs, 0 based on Foata normal form. 10/121 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place.
[2024-11-24 01:39:13,941 INFO L140 encePairwiseOnDemand]: 90/99 looper letters, 7 selfloop transitions, 0 changer transitions 0/88 dead transitions.
[2024-11-24 01:39:13,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 197 flow
[2024-11-24 01:39:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-24 01:39:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-11-24 01:39:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions.
[2024-11-24 01:39:13,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091
[2024-11-24 01:39:13,956 INFO L175 Difference]: Start difference. First operand has 95 places, 99 transitions, 205 flow. Second operand 2 states and 180 transitions.
[2024-11-24 01:39:13,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 197 flow
[2024-11-24 01:39:13,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-24 01:39:13,964 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 183 flow
[2024-11-24 01:39:13,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=89, PETRI_TRANSITIONS=88}
[2024-11-24 01:39:13,970 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places.
[2024-11-24 01:39:13,970 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 183 flow
[2024-11-24 01:39:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-24 01:39:13,971 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:13,971 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]
[2024-11-24 01:39:13,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 01:39:13,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:13,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash -21636026, now seen corresponding path program 1 times
[2024-11-24 01:39:13,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:13,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716293996]
[2024-11-24 01:39:13,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:14,114 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-24 01:39:14,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716293996]
[2024-11-24 01:39:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716293996] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:39:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473206182]
[2024-11-24 01:39:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:14,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:39:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:14,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:39:14,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:39:14,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99
[2024-11-24 01:39:14,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-24 01:39:14,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:14,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99
[2024-11-24 01:39:14,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:14,250 INFO L124 PetriNetUnfolderBase]: 10/174 cut-off events.
[2024-11-24 01:39:14,250 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-11-24 01:39:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 174 events. 10/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 459 event pairs, 0 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 203. Up to 23 conditions per place.
[2024-11-24 01:39:14,252 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 13 selfloop transitions, 2 changer transitions 0/90 dead transitions.
[2024-11-24 01:39:14,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 217 flow
[2024-11-24 01:39:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:39:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:39:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions.
[2024-11-24 01:39:14,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8215488215488216
[2024-11-24 01:39:14,255 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 3 states and 244 transitions.
[2024-11-24 01:39:14,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 217 flow
[2024-11-24 01:39:14,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-24 01:39:14,259 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow
[2024-11-24 01:39:14,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88}
[2024-11-24 01:39:14,260 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places.
[2024-11-24 01:39:14,260 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow
[2024-11-24 01:39:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-24 01:39:14,261 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:14,261 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]
[2024-11-24 01:39:14,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 01:39:14,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:14,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1355265716, now seen corresponding path program 1 times
[2024-11-24 01:39:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955983182]
[2024-11-24 01:39:14,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:14,990 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-24 01:39:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:14,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955983182]
[2024-11-24 01:39:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955983182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:39:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256451219]
[2024-11-24 01:39:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:14,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:39:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:14,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:39:14,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:39:15,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 99
[2024-11-24 01:39:15,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-24 01:39:15,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:15,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 99
[2024-11-24 01:39:15,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:15,276 INFO L124 PetriNetUnfolderBase]: 33/198 cut-off events.
[2024-11-24 01:39:15,276 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-11-24 01:39:15,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 198 events. 33/198 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 658 event pairs, 9 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 292. Up to 56 conditions per place.
[2024-11-24 01:39:15,279 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 28 selfloop transitions, 5 changer transitions 0/95 dead transitions.
[2024-11-24 01:39:15,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 271 flow
[2024-11-24 01:39:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:39:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:39:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions.
[2024-11-24 01:39:15,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6936026936026936
[2024-11-24 01:39:15,286 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 6 states and 412 transitions.
[2024-11-24 01:39:15,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 271 flow
[2024-11-24 01:39:15,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:39:15,289 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 195 flow
[2024-11-24 01:39:15,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=87}
[2024-11-24 01:39:15,292 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places.
[2024-11-24 01:39:15,293 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 195 flow
[2024-11-24 01:39:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-24 01:39:15,294 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:15,294 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]
[2024-11-24 01:39:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 01:39:15,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1535180478, now seen corresponding path program 1 times
[2024-11-24 01:39:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970709592]
[2024-11-24 01:39:15,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:15,355 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-24 01:39:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970709592]
[2024-11-24 01:39:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970709592] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:15,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:15,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:39:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927045907]
[2024-11-24 01:39:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:15,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:39:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:15,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:39:15,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:39:15,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99
[2024-11-24 01:39:15,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:39:15,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:15,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99
[2024-11-24 01:39:15,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:15,409 INFO L124 PetriNetUnfolderBase]: 1/154 cut-off events.
[2024-11-24 01:39:15,409 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES.
[2024-11-24 01:39:15,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 154 events. 1/154 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 313 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place.
[2024-11-24 01:39:15,410 INFO L140 encePairwiseOnDemand]: 96/99 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions.
[2024-11-24 01:39:15,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 218 flow
[2024-11-24 01:39:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:39:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:39:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions.
[2024-11-24 01:39:15,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.835016835016835
[2024-11-24 01:39:15,412 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 195 flow. Second operand 3 states and 248 transitions.
[2024-11-24 01:39:15,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 218 flow
[2024-11-24 01:39:15,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 208 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-11-24 01:39:15,417 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 187 flow
[2024-11-24 01:39:15,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=90, PETRI_TRANSITIONS=86}
[2024-11-24 01:39:15,419 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places.
[2024-11-24 01:39:15,419 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 187 flow
[2024-11-24 01:39:15,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:39:15,419 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:15,420 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]
[2024-11-24 01:39:15,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 01:39:15,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:15,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:15,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1749542407, now seen corresponding path program 1 times
[2024-11-24 01:39:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:15,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175091567]
[2024-11-24 01:39:15,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:15,474 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-24 01:39:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175091567]
[2024-11-24 01:39:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175091567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:39:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488979822]
[2024-11-24 01:39:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:39:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:15,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:39:15,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:39:15,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 99
[2024-11-24 01:39:15,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-24 01:39:15,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:15,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 99
[2024-11-24 01:39:15,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:15,539 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events.
[2024-11-24 01:39:15,539 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES.
[2024-11-24 01:39:15,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 228 events. 8/228 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 824 event pairs, 4 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 272. Up to 25 conditions per place.
[2024-11-24 01:39:15,541 INFO L140 encePairwiseOnDemand]: 93/99 looper letters, 12 selfloop transitions, 4 changer transitions 0/89 dead transitions.
[2024-11-24 01:39:15,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 228 flow
[2024-11-24 01:39:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:39:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:39:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions.
[2024-11-24 01:39:15,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8282828282828283
[2024-11-24 01:39:15,544 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 187 flow. Second operand 3 states and 246 transitions.
[2024-11-24 01:39:15,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 228 flow
[2024-11-24 01:39:15,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:39:15,546 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 211 flow
[2024-11-24 01:39:15,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=91, PETRI_TRANSITIONS=88}
[2024-11-24 01:39:15,547 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places.
[2024-11-24 01:39:15,547 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 211 flow
[2024-11-24 01:39:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-24 01:39:15,548 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:15,548 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-24 01:39:15,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 01:39:15,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1908378960, now seen corresponding path program 1 times
[2024-11-24 01:39:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057370138]
[2024-11-24 01:39:15,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:15,707 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-24 01:39:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:15,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057370138]
[2024-11-24 01:39:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057370138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:39:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363525284]
[2024-11-24 01:39:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:39:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:15,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:39:15,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:39:15,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 99
[2024-11-24 01:39:15,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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-24 01:39:15,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:15,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 99
[2024-11-24 01:39:15,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:15,830 INFO L124 PetriNetUnfolderBase]: 7/99 cut-off events.
[2024-11-24 01:39:15,831 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES.
[2024-11-24 01:39:15,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 99 events. 7/99 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 173 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place.
[2024-11-24 01:39:15,831 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 13 selfloop transitions, 4 changer transitions 0/58 dead transitions.
[2024-11-24 01:39:15,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 176 flow
[2024-11-24 01:39:15,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:39:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:39:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions.
[2024-11-24 01:39:15,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778
[2024-11-24 01:39:15,834 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 211 flow. Second operand 6 states and 462 transitions.
[2024-11-24 01:39:15,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 176 flow
[2024-11-24 01:39:15,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 154 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-11-24 01:39:15,838 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 116 flow
[2024-11-24 01:39:15,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=52}
[2024-11-24 01:39:15,839 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -36 predicate places.
[2024-11-24 01:39:15,839 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 116 flow
[2024-11-24 01:39:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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-24 01:39:15,840 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:15,840 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-24 01:39:15,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 01:39:15,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-11-24 01:39:15,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:15,842 INFO L85 PathProgramCache]: Analyzing trace with hash -207441812, now seen corresponding path program 1 times
[2024-11-24 01:39:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494304392]
[2024-11-24 01:39:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:39:15,875 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:39:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:39:15,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 01:39:15,938 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:39:15,939 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2024-11-24 01:39:15,941 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-11-24 01:39:15,943 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-11-24 01:39:15,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-11-24 01:39:15,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-11-24 01:39:15,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-11-24 01:39:15,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2024-11-24 01:39:15,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-11-24 01:39:15,944 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-11-24 01:39:15,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-11-24 01:39:15,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-11-24 01:39:15,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-11-24 01:39:15,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-11-24 01:39:15,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-11-24 01:39:15,945 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-11-24 01:39:15,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 01:39:15,946 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:39:15,951 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-11-24 01:39:15,951 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-11-24 01:39:15,984 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-11-24 01:39:15,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 120 transitions, 256 flow
[2024-11-24 01:39:16,027 INFO L124 PetriNetUnfolderBase]: 22/256 cut-off events.
[2024-11-24 01:39:16,027 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-11-24 01:39:16,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 256 events. 22/256 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 597 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place.
[2024-11-24 01:39:16,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 120 transitions, 256 flow
[2024-11-24 01:39:16,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 120 transitions, 256 flow
[2024-11-24 01:39:16,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:39:16,034 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;@2d7a1867, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:39:16,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations.
[2024-11-24 01:39:16,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:39:16,038 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events.
[2024-11-24 01:39:16,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:39:16,038 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:16,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:39:16,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1545014184, now seen corresponding path program 1 times
[2024-11-24 01:39:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840829745]
[2024-11-24 01:39:16,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:16,059 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-24 01:39:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840829745]
[2024-11-24 01:39:16,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840829745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:16,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:16,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-24 01:39:16,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218568649]
[2024-11-24 01:39:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:16,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-24 01:39:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:16,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-24 01:39:16,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-24 01:39:16,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120
[2024-11-24 01:39:16,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 120 transitions, 256 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-24 01:39:16,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:16,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120
[2024-11-24 01:39:16,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:16,135 INFO L124 PetriNetUnfolderBase]: 19/254 cut-off events.
[2024-11-24 01:39:16,135 INFO L125 PetriNetUnfolderBase]: For 37/43 co-relation queries the response was YES.
[2024-11-24 01:39:16,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 254 events. 19/254 cut-off events. For 37/43 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 737 event pairs, 4 based on Foata normal form. 26/246 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place.
[2024-11-24 01:39:16,138 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 11 selfloop transitions, 0 changer transitions 0/107 dead transitions.
[2024-11-24 01:39:16,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 252 flow
[2024-11-24 01:39:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-24 01:39:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-11-24 01:39:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions.
[2024-11-24 01:39:16,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9
[2024-11-24 01:39:16,139 INFO L175 Difference]: Start difference. First operand has 115 places, 120 transitions, 256 flow. Second operand 2 states and 216 transitions.
[2024-11-24 01:39:16,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 252 flow
[2024-11-24 01:39:16,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-24 01:39:16,142 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 230 flow
[2024-11-24 01:39:16,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=107}
[2024-11-24 01:39:16,146 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places.
[2024-11-24 01:39:16,149 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 230 flow
[2024-11-24 01:39:16,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-24 01:39:16,149 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:16,149 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]
[2024-11-24 01:39:16,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 01:39:16,150 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:16,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:16,150 INFO L85 PathProgramCache]: Analyzing trace with hash -470147258, now seen corresponding path program 1 times
[2024-11-24 01:39:16,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325585115]
[2024-11-24 01:39:16,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:16,195 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-24 01:39:16,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:16,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325585115]
[2024-11-24 01:39:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325585115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:39:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207912811]
[2024-11-24 01:39:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:16,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:39:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:16,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:39:16,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:39:16,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120
[2024-11-24 01:39:16,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-24 01:39:16,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:16,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120
[2024-11-24 01:39:16,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:16,321 INFO L124 PetriNetUnfolderBase]: 60/451 cut-off events.
[2024-11-24 01:39:16,321 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES.
[2024-11-24 01:39:16,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 451 events. 60/451 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2068 event pairs, 24 based on Foata normal form. 1/395 useless extension candidates. Maximal degree in co-relation 568. Up to 97 conditions per place.
[2024-11-24 01:39:16,325 INFO L140 encePairwiseOnDemand]: 117/120 looper letters, 18 selfloop transitions, 2 changer transitions 0/110 dead transitions.
[2024-11-24 01:39:16,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 276 flow
[2024-11-24 01:39:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:39:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:39:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions.
[2024-11-24 01:39:16,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667
[2024-11-24 01:39:16,330 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 294 transitions.
[2024-11-24 01:39:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 276 flow
[2024-11-24 01:39:16,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-24 01:39:16,333 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 242 flow
[2024-11-24 01:39:16,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=108}
[2024-11-24 01:39:16,335 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places.
[2024-11-24 01:39:16,335 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 242 flow
[2024-11-24 01:39:16,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-24 01:39:16,336 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:16,336 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]
[2024-11-24 01:39:16,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 01:39:16,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:16,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1400530220, now seen corresponding path program 1 times
[2024-11-24 01:39:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:16,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028947471]
[2024-11-24 01:39:16,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:16,681 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-24 01:39:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:16,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028947471]
[2024-11-24 01:39:16,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028947471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:16,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:16,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:39:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873539273]
[2024-11-24 01:39:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:16,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:39:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:16,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:39:16,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:39:16,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 120
[2024-11-24 01:39:16,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-24 01:39:16,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:16,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 120
[2024-11-24 01:39:16,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:17,068 INFO L124 PetriNetUnfolderBase]: 185/628 cut-off events.
[2024-11-24 01:39:17,069 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES.
[2024-11-24 01:39:17,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 628 events. 185/628 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3482 event pairs, 55 based on Foata normal form. 0/568 useless extension candidates. Maximal degree in co-relation 974. Up to 214 conditions per place.
[2024-11-24 01:39:17,075 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 41 selfloop transitions, 5 changer transitions 0/123 dead transitions.
[2024-11-24 01:39:17,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 364 flow
[2024-11-24 01:39:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:39:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:39:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions.
[2024-11-24 01:39:17,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7138888888888889
[2024-11-24 01:39:17,079 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 242 flow. Second operand 6 states and 514 transitions.
[2024-11-24 01:39:17,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 364 flow
[2024-11-24 01:39:17,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 01:39:17,083 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 248 flow
[2024-11-24 01:39:17,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=107}
[2024-11-24 01:39:17,084 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places.
[2024-11-24 01:39:17,085 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 248 flow
[2024-11-24 01:39:17,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-24 01:39:17,085 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:17,086 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]
[2024-11-24 01:39:17,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 01:39:17,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:17,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1727613753, now seen corresponding path program 1 times
[2024-11-24 01:39:17,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:17,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313014595]
[2024-11-24 01:39:17,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:17,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:17,129 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-24 01:39:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313014595]
[2024-11-24 01:39:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313014595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:17,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:17,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:39:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95627909]
[2024-11-24 01:39:17,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:17,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:39:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:17,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:39:17,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:39:17,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120
[2024-11-24 01:39:17,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-24 01:39:17,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:17,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120
[2024-11-24 01:39:17,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:17,302 INFO L124 PetriNetUnfolderBase]: 60/772 cut-off events.
[2024-11-24 01:39:17,303 INFO L125 PetriNetUnfolderBase]: For 122/386 co-relation queries the response was YES.
[2024-11-24 01:39:17,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 772 events. 60/772 cut-off events. For 122/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5036 event pairs, 9 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 951. Up to 62 conditions per place.
[2024-11-24 01:39:17,309 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 22 selfloop transitions, 6 changer transitions 0/118 dead transitions.
[2024-11-24 01:39:17,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 337 flow
[2024-11-24 01:39:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:39:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:39:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions.
[2024-11-24 01:39:17,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667
[2024-11-24 01:39:17,312 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 248 flow. Second operand 3 states and 303 transitions.
[2024-11-24 01:39:17,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 337 flow
[2024-11-24 01:39:17,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 327 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-11-24 01:39:17,316 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 290 flow
[2024-11-24 01:39:17,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=113}
[2024-11-24 01:39:17,318 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places.
[2024-11-24 01:39:17,318 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 290 flow
[2024-11-24 01:39:17,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-24 01:39:17,318 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:17,318 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]
[2024-11-24 01:39:17,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 01:39:17,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:17,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash -747778612, now seen corresponding path program 1 times
[2024-11-24 01:39:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333391286]
[2024-11-24 01:39:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:17,368 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-24 01:39:17,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:17,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333391286]
[2024-11-24 01:39:17,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333391286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:17,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:17,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:39:17,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672943739]
[2024-11-24 01:39:17,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:17,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:39:17,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:17,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:39:17,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:39:17,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 120
[2024-11-24 01:39:17,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-24 01:39:17,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:17,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 120
[2024-11-24 01:39:17,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:17,724 INFO L124 PetriNetUnfolderBase]: 273/1920 cut-off events.
[2024-11-24 01:39:17,724 INFO L125 PetriNetUnfolderBase]: For 374/820 co-relation queries the response was YES.
[2024-11-24 01:39:17,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1920 events. 273/1920 cut-off events. For 374/820 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16712 event pairs, 93 based on Foata normal form. 1/1652 useless extension candidates. Maximal degree in co-relation 2702. Up to 395 conditions per place.
[2024-11-24 01:39:17,735 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 27 selfloop transitions, 8 changer transitions 0/126 dead transitions.
[2024-11-24 01:39:17,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 405 flow
[2024-11-24 01:39:17,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:39:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:39:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions.
[2024-11-24 01:39:17,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2024-11-24 01:39:17,737 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 290 flow. Second operand 3 states and 300 transitions.
[2024-11-24 01:39:17,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 405 flow
[2024-11-24 01:39:17,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:39:17,742 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 348 flow
[2024-11-24 01:39:17,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=114, PETRI_TRANSITIONS=121}
[2024-11-24 01:39:17,746 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places.
[2024-11-24 01:39:17,746 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 348 flow
[2024-11-24 01:39:17,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-24 01:39:17,746 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:17,746 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-24 01:39:17,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 01:39:17,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:17,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1623492035, now seen corresponding path program 1 times
[2024-11-24 01:39:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14462220]
[2024-11-24 01:39:17,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:17,832 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-24 01:39:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:17,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14462220]
[2024-11-24 01:39:17,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14462220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:17,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:17,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:39:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475088207]
[2024-11-24 01:39:17,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:17,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:39:17,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:17,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:39:17,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:39:17,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120
[2024-11-24 01:39:17,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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-24 01:39:17,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:17,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120
[2024-11-24 01:39:17,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:18,356 INFO L124 PetriNetUnfolderBase]: 428/2871 cut-off events.
[2024-11-24 01:39:18,356 INFO L125 PetriNetUnfolderBase]: For 839/949 co-relation queries the response was YES.
[2024-11-24 01:39:18,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 2871 events. 428/2871 cut-off events. For 839/949 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 28174 event pairs, 147 based on Foata normal form. 19/2535 useless extension candidates. Maximal degree in co-relation 4411. Up to 458 conditions per place.
[2024-11-24 01:39:18,371 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 35 selfloop transitions, 5 changer transitions 0/137 dead transitions.
[2024-11-24 01:39:18,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 137 transitions, 498 flow
[2024-11-24 01:39:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:39:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:39:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions.
[2024-11-24 01:39:18,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7875
[2024-11-24 01:39:18,373 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 348 flow. Second operand 6 states and 567 transitions.
[2024-11-24 01:39:18,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 137 transitions, 498 flow
[2024-11-24 01:39:18,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 137 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:39:18,383 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 358 flow
[2024-11-24 01:39:18,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=120, PETRI_TRANSITIONS=123}
[2024-11-24 01:39:18,384 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places.
[2024-11-24 01:39:18,384 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 358 flow
[2024-11-24 01:39:18,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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-24 01:39:18,385 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:18,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:18,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-24 01:39:18,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:18,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash 255851633, now seen corresponding path program 1 times
[2024-11-24 01:39:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527828491]
[2024-11-24 01:39:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:18,493 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-24 01:39:18,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527828491]
[2024-11-24 01:39:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527828491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:18,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 01:39:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147458590]
[2024-11-24 01:39:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:18,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 01:39:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:18,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 01:39:18,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 01:39:18,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120
[2024-11-24 01:39:18,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-24 01:39:18,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:18,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120
[2024-11-24 01:39:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:18,894 INFO L124 PetriNetUnfolderBase]: 224/2215 cut-off events.
[2024-11-24 01:39:18,894 INFO L125 PetriNetUnfolderBase]: For 304/598 co-relation queries the response was YES.
[2024-11-24 01:39:18,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 2215 events. 224/2215 cut-off events. For 304/598 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 21342 event pairs, 65 based on Foata normal form. 33/1998 useless extension candidates. Maximal degree in co-relation 3025. Up to 283 conditions per place.
[2024-11-24 01:39:18,907 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 30 selfloop transitions, 6 changer transitions 0/138 dead transitions.
[2024-11-24 01:39:18,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 499 flow
[2024-11-24 01:39:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:39:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:39:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions.
[2024-11-24 01:39:18,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8316666666666667
[2024-11-24 01:39:18,910 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 358 flow. Second operand 5 states and 499 transitions.
[2024-11-24 01:39:18,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 499 flow
[2024-11-24 01:39:18,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 493 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-24 01:39:18,917 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 387 flow
[2024-11-24 01:39:18,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=124, PETRI_TRANSITIONS=124}
[2024-11-24 01:39:18,918 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places.
[2024-11-24 01:39:18,918 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 387 flow
[2024-11-24 01:39:18,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-24 01:39:18,919 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:18,919 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-24 01:39:18,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:18,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1882245195, now seen corresponding path program 1 times
[2024-11-24 01:39:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553099684]
[2024-11-24 01:39:18,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:18,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:39:19,081 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-24 01:39:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:39:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553099684]
[2024-11-24 01:39:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553099684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:39:19,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:39:19,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-24 01:39:19,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367937795]
[2024-11-24 01:39:19,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:39:19,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 01:39:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:39:19,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 01:39:19,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 01:39:19,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120
[2024-11-24 01:39:19,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-24 01:39:19,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:39:19,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120
[2024-11-24 01:39:19,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:39:19,426 INFO L124 PetriNetUnfolderBase]: 204/2065 cut-off events.
[2024-11-24 01:39:19,426 INFO L125 PetriNetUnfolderBase]: For 544/718 co-relation queries the response was YES.
[2024-11-24 01:39:19,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 2065 events. 204/2065 cut-off events. For 544/718 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19650 event pairs, 60 based on Foata normal form. 33/1881 useless extension candidates. Maximal degree in co-relation 3032. Up to 257 conditions per place.
[2024-11-24 01:39:19,436 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 26 selfloop transitions, 7 changer transitions 0/135 dead transitions.
[2024-11-24 01:39:19,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 135 transitions, 510 flow
[2024-11-24 01:39:19,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:39:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:39:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions.
[2024-11-24 01:39:19,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.825
[2024-11-24 01:39:19,439 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 387 flow. Second operand 5 states and 495 transitions.
[2024-11-24 01:39:19,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 135 transitions, 510 flow
[2024-11-24 01:39:19,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 135 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-24 01:39:19,443 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 421 flow
[2024-11-24 01:39:19,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=129, PETRI_TRANSITIONS=125}
[2024-11-24 01:39:19,444 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places.
[2024-11-24 01:39:19,444 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 421 flow
[2024-11-24 01:39:19,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-24 01:39:19,444 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:39:19,444 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:39:19,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-24 01:39:19,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2024-11-24 01:39:19,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:39:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -885109468, now seen corresponding path program 1 times
[2024-11-24 01:39:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:39:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868324207]
[2024-11-24 01:39:19,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:39:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:39:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:39:19,474 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:39:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:39:19,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 01:39:19,505 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:39:19,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining)
[2024-11-24 01:39:19,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining)
[2024-11-24 01:39:19,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining)
[2024-11-24 01:39:19,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining)
[2024-11-24 01:39:19,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining)
[2024-11-24 01:39:19,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining)
[2024-11-24 01:39:19,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-24 01:39:19,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:39:19,587 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-11-24 01:39:19,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 01:39:19,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:39:19 BasicIcfg
[2024-11-24 01:39:19,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 01:39:19,597 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 01:39:19,597 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 01:39:19,598 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 01:39:19,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:39:13" (3/4) ...
[2024-11-24 01:39:19,601 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-24 01:39:19,673 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 6.
[2024-11-24 01:39:19,730 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/witness.graphml
[2024-11-24 01:39:19,733 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/witness.yml
[2024-11-24 01:39:19,735 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 01:39:19,736 INFO L158 Benchmark]: Toolchain (without parser) took 7382.65ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 91.3MB in the beginning and 90.0MB in the end (delta: 1.3MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB.
[2024-11-24 01:39:19,736 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 98.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:39:19,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.12ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 71.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-24 01:39:19,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.08ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 69.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:39:19,737 INFO L158 Benchmark]: Boogie Preprocessor took 30.93ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 68.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 01:39:19,737 INFO L158 Benchmark]: RCFGBuilder took 476.95ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 51.2MB in the end (delta: 17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:39:19,740 INFO L158 Benchmark]: TraceAbstraction took 6194.41ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 50.6MB in the beginning and 102.5MB in the end (delta: -51.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB.
[2024-11-24 01:39:19,740 INFO L158 Benchmark]: Witness Printer took 137.54ms. Allocated memory is still 201.3MB. Free memory was 102.5MB in the beginning and 90.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 01:39:19,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 73.2MB in the end (delta: 98.7kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 495.12ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 71.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 40.08ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 69.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 30.93ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 68.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 476.95ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 51.2MB in the end (delta: 17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 6194.41ms. Allocated memory was 117.4MB in the beginning and 201.3MB in the end (delta: 83.9MB). Free memory was 50.6MB in the beginning and 102.5MB in the end (delta: -51.9MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB.
* Witness Printer took 137.54ms. Allocated memory is still 201.3MB. Free memory was 102.5MB in the beginning and 90.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- DataRaceFoundResult [Line: 722]: Data race detected
Data race detected
The following path leads to a data race:
[L717] 0 int numberOfSeatsSold;
VAL [numberOfSeatsSold=0]
[L718] 0 int stopSales;
VAL [numberOfSeatsSold=0, stopSales=0]
[L719] 0 int numOfTickets;
VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0]
[L736] 0 pthread_t salethreads[15];
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L738] 0 numOfTickets = 15
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L741] 0 numberOfSeatsSold = 0
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L744] 0 stopSales = 0
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L746] 0 int i = 0;
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L746] COND TRUE 0 i < 15
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0))
VAL [\old(argc)=61, \old(argv)={66:62}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0))
VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={66:62}, argc=61, i=0, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L746] 0 i++
VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={66:62}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L746] COND TRUE 0 i < 15
VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={66:62}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0))
VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={66:62}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0))
VAL [\old(arg)={0:0}, \old(argc)=61, \old(argv)={66:62}, argc=61, i=1, numOfTickets=15, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0]
[L721] 1 !stopSales
VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L721] COND TRUE 1 !stopSales
VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L722] 1 int _numberOfSeatsSold = numberOfSeatsSold;
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L723] COND FALSE 1 !(_numberOfSeatsSold >= (15 - (((15 / 10) == 0) ? 1 : (15 / 10))))
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L721] 2 !stopSales
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L721] COND TRUE 2 !stopSales
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L722] 2 int _numberOfSeatsSold = numberOfSeatsSold;
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=0, stopSales=0]
[L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=1, stopSales=0]
[L722] 2 int _numberOfSeatsSold = numberOfSeatsSold;
VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=15, numberOfSeatsSold=1, stopSales=0]
Now there is a data race on ~numberOfSeatsSold~0 between
C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729]
and
C: int _numberOfSeatsSold = numberOfSeatsSold; [722]
- UnprovableResult [Line: 721]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 725]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 729]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 738]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 741]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 744]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 752]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 750]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 747]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 3 procedures, 111 locations, 15 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: 2.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 9 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 23, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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
- StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
CFG has 4 procedures, 129 locations, 19 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: 3.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 37 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=8, InterpolantAutomatonStates: 33, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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
RESULT: Ultimate proved your program to be incorrect!
[2024-11-24 01:39:19,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5da56631-66ae-434b-991e-ca6b2c88bcec/bin/uautomizer-verify-LYvppIcaGC/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
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(DATA-RACE)