./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-7-racy.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-7-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX --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 a938b9e3b803ef0b08d2618a78ac055be54a6e48f84c6853aab11e3467af8157
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:02:28,882 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:02:29,006 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-11-08 17:02:29,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:02:29,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:02:29,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:02:29,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:02:29,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:02:29,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:02:29,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:02:29,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:02:29,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:02:29,062 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:02:29,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:02:29,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:02:29,064 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:02:29,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:02:29,065 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:02:29,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:02:29,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:02:29,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:02:29,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:02:29,074 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-11-08 17:02:29,074 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:02:29,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 17:02:29,075 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:02:29,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:02:29,076 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:02:29,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:02:29,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:02:29,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:02:29,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:02:29,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:02:29,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:02:29,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:02:29,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:02:29,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:02:29,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:02:29,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:02:29,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:02:29,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:02:29,088 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX
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 -> a938b9e3b803ef0b08d2618a78ac055be54a6e48f84c6853aab11e3467af8157
[2024-11-08 17:02:29,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:02:29,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:02:29,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:02:29,491 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:02:29,492 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:02:29,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread/fib_unsafe-7-racy.i
Unable to find full path for "g++"
[2024-11-08 17:02:32,047 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:02:32,391 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:02:32,391 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/sv-benchmarks/c/pthread/fib_unsafe-7-racy.i
[2024-11-08 17:02:32,411 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/data/e0a6fa027/8b7e0cf1f0f14cc6b454a08e2a8197a9/FLAGacdfbbada
[2024-11-08 17:02:32,437 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/data/e0a6fa027/8b7e0cf1f0f14cc6b454a08e2a8197a9
[2024-11-08 17:02:32,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:02:32,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:02:32,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:02:32,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:02:32,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:02:32,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:32" (1/1) ...
[2024-11-08 17:02:32,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1949393a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:32, skipping insertion in model container
[2024-11-08 17:02:32,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:02:32" (1/1) ...
[2024-11-08 17:02:32,541 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:02:33,164 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:02:33,184 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:02:33,263 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:02:33,324 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:02:33,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33 WrapperNode
[2024-11-08 17:02:33,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:02:33,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:02:33,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:02:33,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:02:33,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,393 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113
[2024-11-08 17:02:33,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:02:33,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:02:33,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:02:33,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:02:33,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:02:33,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:02:33,441 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:02:33,441 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:02:33,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (1/1) ...
[2024-11-08 17:02:33,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:02:33,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:33,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:02:33,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:02:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure t1
[2024-11-08 17:02:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure t1
[2024-11-08 17:02:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure t2
[2024-11-08 17:02:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure t2
[2024-11-08 17:02:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 17:02:33,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:02:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-08 17:02:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 17:02:33,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:02:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:02:33,553 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 17:02:33,754 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:02:33,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:02:34,154 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 17:02:34,154 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:02:34,257 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:02:34,257 INFO L316 CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-08 17:02:34,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:34 BoogieIcfgContainer
[2024-11-08 17:02:34,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:02:34,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:02:34,261 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:02:34,267 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:02:34,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:02:32" (1/3) ...
[2024-11-08 17:02:34,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291bab73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:02:34, skipping insertion in model container
[2024-11-08 17:02:34,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:02:33" (2/3) ...
[2024-11-08 17:02:34,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291bab73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:02:34, skipping insertion in model container
[2024-11-08 17:02:34,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:34" (3/3) ...
[2024-11-08 17:02:34,271 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7-racy.i
[2024-11-08 17:02:34,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:02:34,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations.
[2024-11-08 17:02:34,299 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 17:02:34,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 17:02:34,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow
[2024-11-08 17:02:34,618 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events.
[2024-11-08 17:02:34,619 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:34,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 186 events. 9/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 382 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place.
[2024-11-08 17:02:34,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow
[2024-11-08 17:02:34,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow
[2024-11-08 17:02:34,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:02:34,670 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;@433a2abc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:02:34,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations.
[2024-11-08 17:02:34,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 17:02:34,680 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events.
[2024-11-08 17:02:34,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:34,680 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:34,681 INFO L204 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]
[2024-11-08 17:02:34,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:34,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1312725550, now seen corresponding path program 1 times
[2024-11-08 17:02:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523045644]
[2024-11-08 17:02:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:35,058 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-08 17:02:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523045644]
[2024-11-08 17:02:35,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523045644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:35,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:35,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 17:02:35,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242119153]
[2024-11-08 17:02:35,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:02:35,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:02:35,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:02:35,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188
[2024-11-08 17:02:35,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 378 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-08 17:02:35,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:35,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188
[2024-11-08 17:02:35,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:35,286 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events.
[2024-11-08 17:02:35,286 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-08 17:02:35,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 286 events. 9/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 931 event pairs, 2 based on Foata normal form. 12/248 useless extension candidates. Maximal degree in co-relation 270. Up to 11 conditions per place.
[2024-11-08 17:02:35,298 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions.
[2024-11-08 17:02:35,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow
[2024-11-08 17:02:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:02:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2024-11-08 17:02:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions.
[2024-11-08 17:02:35,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128
[2024-11-08 17:02:35,324 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions.
[2024-11-08 17:02:35,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow
[2024-11-08 17:02:35,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:35,336 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow
[2024-11-08 17:02:35,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=346, PETRI_PLACES=173, PETRI_TRANSITIONS=171}
[2024-11-08 17:02:35,344 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places.
[2024-11-08 17:02:35,344 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow
[2024-11-08 17:02:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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-08 17:02:35,345 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:35,345 INFO L204 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]
[2024-11-08 17:02:35,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:02:35,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 547883607, now seen corresponding path program 1 times
[2024-11-08 17:02:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121002202]
[2024-11-08 17:02:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:35,523 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-08 17:02:35,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121002202]
[2024-11-08 17:02:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121002202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:35,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876282050]
[2024-11-08 17:02:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:35,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:35,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:35,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:35,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:35,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 171 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-08 17:02:35,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:35,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:35,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:35,738 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events.
[2024-11-08 17:02:35,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:35,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 366 events. 30/366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1651 event pairs, 8 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 436. Up to 41 conditions per place.
[2024-11-08 17:02:35,748 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions.
[2024-11-08 17:02:35,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow
[2024-11-08 17:02:35,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2024-11-08 17:02:35,758 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752
[2024-11-08 17:02:35,759 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions.
[2024-11-08 17:02:35,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow
[2024-11-08 17:02:35,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-08 17:02:35,769 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow
[2024-11-08 17:02:35,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170}
[2024-11-08 17:02:35,771 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places.
[2024-11-08 17:02:35,771 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow
[2024-11-08 17:02:35,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-08 17:02:35,773 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:35,773 INFO L204 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]
[2024-11-08 17:02:35,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 17:02:35,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:35,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:35,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1125317834, now seen corresponding path program 1 times
[2024-11-08 17:02:35,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054590949]
[2024-11-08 17:02:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:35,889 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-08 17:02:35,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054590949]
[2024-11-08 17:02:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054590949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:35,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:35,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011543851]
[2024-11-08 17:02:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:35,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:35,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:35,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:35,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:35,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-08 17:02:35,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:35,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:35,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:36,058 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events.
[2024-11-08 17:02:36,059 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-08 17:02:36,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 222 events. 20/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 806 event pairs, 4 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place.
[2024-11-08 17:02:36,064 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions.
[2024-11-08 17:02:36,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow
[2024-11-08 17:02:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2024-11-08 17:02:36,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752
[2024-11-08 17:02:36,070 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions.
[2024-11-08 17:02:36,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow
[2024-11-08 17:02:36,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:36,080 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow
[2024-11-08 17:02:36,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168}
[2024-11-08 17:02:36,082 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places.
[2024-11-08 17:02:36,083 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow
[2024-11-08 17:02:36,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-08 17:02:36,084 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:36,084 INFO L204 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]
[2024-11-08 17:02:36,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 17:02:36,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:36,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:36,086 INFO L85 PathProgramCache]: Analyzing trace with hash -413067327, now seen corresponding path program 1 times
[2024-11-08 17:02:36,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:36,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369558655]
[2024-11-08 17:02:36,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:36,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:36,225 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-08 17:02:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369558655]
[2024-11-08 17:02:36,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369558655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:36,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:36,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491042321]
[2024-11-08 17:02:36,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:36,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:36,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:36,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:36,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:36,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:36,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:36,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:36,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:36,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:36,405 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events.
[2024-11-08 17:02:36,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:36,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1079 event pairs, 7 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 327. Up to 26 conditions per place.
[2024-11-08 17:02:36,411 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions.
[2024-11-08 17:02:36,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow
[2024-11-08 17:02:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions.
[2024-11-08 17:02:36,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851
[2024-11-08 17:02:36,418 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions.
[2024-11-08 17:02:36,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow
[2024-11-08 17:02:36,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:36,425 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow
[2024-11-08 17:02:36,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=171, PETRI_TRANSITIONS=167}
[2024-11-08 17:02:36,429 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places.
[2024-11-08 17:02:36,431 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow
[2024-11-08 17:02:36,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:36,432 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:36,432 INFO L204 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]
[2024-11-08 17:02:36,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 17:02:36,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:36,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1987481941, now seen corresponding path program 1 times
[2024-11-08 17:02:36,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040772232]
[2024-11-08 17:02:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:36,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:36,533 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-08 17:02:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040772232]
[2024-11-08 17:02:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040772232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:36,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:36,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197122396]
[2024-11-08 17:02:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:36,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:36,601 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188
[2024-11-08 17:02:36,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-08 17:02:36,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:36,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188
[2024-11-08 17:02:36,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:36,752 INFO L124 PetriNetUnfolderBase]: 49/479 cut-off events.
[2024-11-08 17:02:36,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:36,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 479 events. 49/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2570 event pairs, 30 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 571. Up to 67 conditions per place.
[2024-11-08 17:02:36,760 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/168 dead transitions.
[2024-11-08 17:02:36,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 378 flow
[2024-11-08 17:02:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions.
[2024-11-08 17:02:36,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149
[2024-11-08 17:02:36,763 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 492 transitions.
[2024-11-08 17:02:36,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 378 flow
[2024-11-08 17:02:36,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:36,770 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 340 flow
[2024-11-08 17:02:36,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=170, PETRI_TRANSITIONS=166}
[2024-11-08 17:02:36,772 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -14 predicate places.
[2024-11-08 17:02:36,773 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 340 flow
[2024-11-08 17:02:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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-08 17:02:36,774 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:36,774 INFO L204 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]
[2024-11-08 17:02:36,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 17:02:36,776 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:36,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:36,778 INFO L85 PathProgramCache]: Analyzing trace with hash -606899330, now seen corresponding path program 1 times
[2024-11-08 17:02:36,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:36,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971136994]
[2024-11-08 17:02:36,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:36,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:36,868 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-08 17:02:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971136994]
[2024-11-08 17:02:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971136994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:36,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:36,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096096518]
[2024-11-08 17:02:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:36,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:36,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:36,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:36,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:36,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:36,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:36,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:36,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:36,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:36,999 INFO L124 PetriNetUnfolderBase]: 15/281 cut-off events.
[2024-11-08 17:02:36,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:37,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 281 events. 15/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1018 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 319. Up to 15 conditions per place.
[2024-11-08 17:02:37,005 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/165 dead transitions.
[2024-11-08 17:02:37,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 364 flow
[2024-11-08 17:02:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions.
[2024-11-08 17:02:37,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851
[2024-11-08 17:02:37,009 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 340 flow. Second operand 3 states and 495 transitions.
[2024-11-08 17:02:37,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 364 flow
[2024-11-08 17:02:37,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:37,014 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow
[2024-11-08 17:02:37,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164}
[2024-11-08 17:02:37,017 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places.
[2024-11-08 17:02:37,018 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow
[2024-11-08 17:02:37,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:37,019 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:37,019 INFO L204 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]
[2024-11-08 17:02:37,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 17:02:37,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:37,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1344962317, now seen corresponding path program 1 times
[2024-11-08 17:02:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:37,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447532903]
[2024-11-08 17:02:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:37,090 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-08 17:02:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447532903]
[2024-11-08 17:02:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447532903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:37,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091977074]
[2024-11-08 17:02:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:37,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:37,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:37,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:37,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:37,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:37,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:37,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:37,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:37,246 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events.
[2024-11-08 17:02:37,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:37,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 449 events. 37/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2214 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 517. Up to 32 conditions per place.
[2024-11-08 17:02:37,252 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions.
[2024-11-08 17:02:37,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow
[2024-11-08 17:02:37,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2024-11-08 17:02:37,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752
[2024-11-08 17:02:37,255 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions.
[2024-11-08 17:02:37,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow
[2024-11-08 17:02:37,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:37,259 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow
[2024-11-08 17:02:37,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162}
[2024-11-08 17:02:37,261 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places.
[2024-11-08 17:02:37,261 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow
[2024-11-08 17:02:37,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:37,262 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:37,262 INFO L204 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]
[2024-11-08 17:02:37,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 17:02:37,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:37,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1572796447, now seen corresponding path program 1 times
[2024-11-08 17:02:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392432523]
[2024-11-08 17:02:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:37,344 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-08 17:02:37,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:37,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392432523]
[2024-11-08 17:02:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392432523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:37,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786117370]
[2024-11-08 17:02:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:37,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:37,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:37,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:37,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-08 17:02:37,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:37,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:37,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:37,458 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events.
[2024-11-08 17:02:37,459 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:37,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 20/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 753 event pairs, 10 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place.
[2024-11-08 17:02:37,462 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions.
[2024-11-08 17:02:37,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow
[2024-11-08 17:02:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2024-11-08 17:02:37,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752
[2024-11-08 17:02:37,465 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions.
[2024-11-08 17:02:37,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow
[2024-11-08 17:02:37,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:37,470 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow
[2024-11-08 17:02:37,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=165, PETRI_TRANSITIONS=161}
[2024-11-08 17:02:37,473 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places.
[2024-11-08 17:02:37,473 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow
[2024-11-08 17:02:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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-08 17:02:37,475 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:37,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:37,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 17:02:37,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:37,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 22835276, now seen corresponding path program 1 times
[2024-11-08 17:02:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591066967]
[2024-11-08 17:02:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:37,545 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-08 17:02:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:37,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591066967]
[2024-11-08 17:02:37,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591066967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:37,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:37,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124447281]
[2024-11-08 17:02:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:37,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:37,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188
[2024-11-08 17:02:37,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-08 17:02:37,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:37,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188
[2024-11-08 17:02:37,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:37,668 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events.
[2024-11-08 17:02:37,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 412 events. 33/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1868 event pairs, 6 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 472. Up to 32 conditions per place.
[2024-11-08 17:02:37,674 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions.
[2024-11-08 17:02:37,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow
[2024-11-08 17:02:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions.
[2024-11-08 17:02:37,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553
[2024-11-08 17:02:37,677 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions.
[2024-11-08 17:02:37,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow
[2024-11-08 17:02:37,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:37,682 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow
[2024-11-08 17:02:37,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=159}
[2024-11-08 17:02:37,684 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places.
[2024-11-08 17:02:37,684 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow
[2024-11-08 17:02:37,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-08 17:02:37,685 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:37,685 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 17:02:37,686 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 469878906, now seen corresponding path program 1 times
[2024-11-08 17:02:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995455078]
[2024-11-08 17:02:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:37,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:37,744 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-08 17:02:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995455078]
[2024-11-08 17:02:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995455078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:37,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:37,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522624894]
[2024-11-08 17:02:37,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:37,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:37,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188
[2024-11-08 17:02:37,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-08 17:02:37,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:37,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188
[2024-11-08 17:02:37,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:37,871 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events.
[2024-11-08 17:02:37,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:37,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 360 events. 31/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1470 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 426. Up to 32 conditions per place.
[2024-11-08 17:02:37,877 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions.
[2024-11-08 17:02:37,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow
[2024-11-08 17:02:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions.
[2024-11-08 17:02:37,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553
[2024-11-08 17:02:37,881 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions.
[2024-11-08 17:02:37,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow
[2024-11-08 17:02:37,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:37,885 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow
[2024-11-08 17:02:37,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=157}
[2024-11-08 17:02:37,887 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places.
[2024-11-08 17:02:37,887 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow
[2024-11-08 17:02:37,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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-08 17:02:37,888 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:37,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:37,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 17:02:37,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:37,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1938967755, now seen corresponding path program 1 times
[2024-11-08 17:02:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439811139]
[2024-11-08 17:02:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:37,949 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-08 17:02:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439811139]
[2024-11-08 17:02:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439811139] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:37,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:37,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243884766]
[2024-11-08 17:02:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:37,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:37,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:37,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:37,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-08 17:02:37,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:37,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:37,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:38,071 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events.
[2024-11-08 17:02:38,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:38,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 266 events. 15/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 920 event pairs, 6 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 306. Up to 25 conditions per place.
[2024-11-08 17:02:38,075 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions.
[2024-11-08 17:02:38,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow
[2024-11-08 17:02:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions.
[2024-11-08 17:02:38,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851
[2024-11-08 17:02:38,078 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions.
[2024-11-08 17:02:38,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow
[2024-11-08 17:02:38,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:38,082 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow
[2024-11-08 17:02:38,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=160, PETRI_TRANSITIONS=156}
[2024-11-08 17:02:38,083 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places.
[2024-11-08 17:02:38,084 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow
[2024-11-08 17:02:38,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-08 17:02:38,085 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:38,085 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:38,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 17:02:38,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:38,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:38,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1030585671, now seen corresponding path program 1 times
[2024-11-08 17:02:38,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:38,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201892369]
[2024-11-08 17:02:38,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:38,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:38,135 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-08 17:02:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201892369]
[2024-11-08 17:02:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201892369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:38,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:38,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512586599]
[2024-11-08 17:02:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:38,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:38,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:38,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188
[2024-11-08 17:02:38,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-08 17:02:38,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:38,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188
[2024-11-08 17:02:38,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:38,270 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events.
[2024-11-08 17:02:38,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:38,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 436 events. 41/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2170 event pairs, 22 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 512. Up to 51 conditions per place.
[2024-11-08 17:02:38,275 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions.
[2024-11-08 17:02:38,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow
[2024-11-08 17:02:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2024-11-08 17:02:38,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752
[2024-11-08 17:02:38,279 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions.
[2024-11-08 17:02:38,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow
[2024-11-08 17:02:38,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:38,284 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow
[2024-11-08 17:02:38,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=159, PETRI_TRANSITIONS=155}
[2024-11-08 17:02:38,285 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places.
[2024-11-08 17:02:38,286 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow
[2024-11-08 17:02:38,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-08 17:02:38,287 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:38,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:38,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 17:02:38,288 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:38,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 626611992, now seen corresponding path program 1 times
[2024-11-08 17:02:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:38,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763467938]
[2024-11-08 17:02:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:38,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:38,382 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-08 17:02:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763467938]
[2024-11-08 17:02:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763467938] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:38,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:38,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:02:38,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311379886]
[2024-11-08 17:02:38,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:38,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:38,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:38,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188
[2024-11-08 17:02:38,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-08 17:02:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:38,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188
[2024-11-08 17:02:38,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:38,541 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events.
[2024-11-08 17:02:38,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:38,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 550 events. 25/550 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2286 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 611. Up to 21 conditions per place.
[2024-11-08 17:02:38,547 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions.
[2024-11-08 17:02:38,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow
[2024-11-08 17:02:38,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions.
[2024-11-08 17:02:38,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759
[2024-11-08 17:02:38,550 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions.
[2024-11-08 17:02:38,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow
[2024-11-08 17:02:38,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:38,556 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow
[2024-11-08 17:02:38,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=156}
[2024-11-08 17:02:38,558 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places.
[2024-11-08 17:02:38,558 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow
[2024-11-08 17:02:38,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-08 17:02:38,560 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:38,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 17:02:38,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -684023188, now seen corresponding path program 1 times
[2024-11-08 17:02:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402390595]
[2024-11-08 17:02:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:38,613 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-08 17:02:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:38,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402390595]
[2024-11-08 17:02:38,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402390595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:38,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:38,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093276357]
[2024-11-08 17:02:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:38,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:38,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:38,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:38,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188
[2024-11-08 17:02:38,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-08 17:02:38,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:38,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188
[2024-11-08 17:02:38,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:38,785 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events.
[2024-11-08 17:02:38,785 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-11-08 17:02:38,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 584 events. 65/584 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place.
[2024-11-08 17:02:38,791 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions.
[2024-11-08 17:02:38,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow
[2024-11-08 17:02:38,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions.
[2024-11-08 17:02:38,794 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695
[2024-11-08 17:02:38,794 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions.
[2024-11-08 17:02:38,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow
[2024-11-08 17:02:38,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 17:02:38,798 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow
[2024-11-08 17:02:38,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=155}
[2024-11-08 17:02:38,799 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places.
[2024-11-08 17:02:38,799 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow
[2024-11-08 17:02:38,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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-08 17:02:38,800 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:38,800 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:38,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 17:02:38,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:38,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:38,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1885469575, now seen corresponding path program 1 times
[2024-11-08 17:02:38,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:38,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630077378]
[2024-11-08 17:02:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:38,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:38,836 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-08 17:02:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630077378]
[2024-11-08 17:02:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630077378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:38,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:38,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934544231]
[2024-11-08 17:02:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:38,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:38,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:38,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:38,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188
[2024-11-08 17:02:38,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-08 17:02:38,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:38,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188
[2024-11-08 17:02:38,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:38,959 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events.
[2024-11-08 17:02:38,960 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:38,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 554 events. 49/554 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2407 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 651. Up to 40 conditions per place.
[2024-11-08 17:02:38,965 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions.
[2024-11-08 17:02:38,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow
[2024-11-08 17:02:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions.
[2024-11-08 17:02:38,967 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859
[2024-11-08 17:02:38,968 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions.
[2024-11-08 17:02:38,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow
[2024-11-08 17:02:38,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:38,971 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow
[2024-11-08 17:02:38,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=155}
[2024-11-08 17:02:38,972 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places.
[2024-11-08 17:02:38,973 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow
[2024-11-08 17:02:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-08 17:02:38,973 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:38,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:38,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 17:02:38,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 821221772, now seen corresponding path program 1 times
[2024-11-08 17:02:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:38,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440639127]
[2024-11-08 17:02:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:39,030 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-08 17:02:39,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440639127]
[2024-11-08 17:02:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440639127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:39,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:39,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:39,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818464786]
[2024-11-08 17:02:39,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:39,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:39,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:39,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:39,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:39,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188
[2024-11-08 17:02:39,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:39,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:39,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188
[2024-11-08 17:02:39,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:39,220 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events.
[2024-11-08 17:02:39,221 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES.
[2024-11-08 17:02:39,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 572 events. 69/572 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2880 event pairs, 42 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 733. Up to 91 conditions per place.
[2024-11-08 17:02:39,227 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions.
[2024-11-08 17:02:39,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow
[2024-11-08 17:02:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:39,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions.
[2024-11-08 17:02:39,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695
[2024-11-08 17:02:39,230 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions.
[2024-11-08 17:02:39,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow
[2024-11-08 17:02:39,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 17:02:39,236 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow
[2024-11-08 17:02:39,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=154}
[2024-11-08 17:02:39,237 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places.
[2024-11-08 17:02:39,237 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow
[2024-11-08 17:02:39,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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-08 17:02:39,238 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:39,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:02:39,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 17:02:39,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:39,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1486328027, now seen corresponding path program 1 times
[2024-11-08 17:02:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:39,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065006819]
[2024-11-08 17:02:39,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:39,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:39,292 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-08 17:02:39,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:39,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065006819]
[2024-11-08 17:02:39,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065006819] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:39,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:02:39,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:02:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275491488]
[2024-11-08 17:02:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:39,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:39,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:02:39,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188
[2024-11-08 17:02:39,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-08 17:02:39,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:39,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188
[2024-11-08 17:02:39,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:39,459 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events.
[2024-11-08 17:02:39,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 556 events. 57/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2543 event pairs, 38 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 705. Up to 83 conditions per place.
[2024-11-08 17:02:39,466 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions.
[2024-11-08 17:02:39,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow
[2024-11-08 17:02:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions.
[2024-11-08 17:02:39,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149
[2024-11-08 17:02:39,470 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions.
[2024-11-08 17:02:39,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow
[2024-11-08 17:02:39,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:39,475 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow
[2024-11-08 17:02:39,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=159, PETRI_TRANSITIONS=153}
[2024-11-08 17:02:39,476 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places.
[2024-11-08 17:02:39,477 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow
[2024-11-08 17:02:39,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-08 17:02:39,478 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:39,478 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:39,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 17:02:39,479 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:39,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash 850859623, now seen corresponding path program 1 times
[2024-11-08 17:02:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673458034]
[2024-11-08 17:02:39,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:39,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673458034]
[2024-11-08 17:02:39,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673458034] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:02:39,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841731363]
[2024-11-08 17:02:39,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:39,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:39,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:39,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:02:39,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 17:02:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:39,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:02:39,816 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:02:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-08 17:02:39,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:02:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841731363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:39,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 17:02:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2024-11-08 17:02:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824178413]
[2024-11-08 17:02:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:39,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:39,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:39,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:39,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:02:39,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188
[2024-11-08 17:02:39,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-08 17:02:39,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:39,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188
[2024-11-08 17:02:39,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:39,975 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events.
[2024-11-08 17:02:39,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:02:39,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 36/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1794 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 563. Up to 31 conditions per place.
[2024-11-08 17:02:39,981 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions.
[2024-11-08 17:02:39,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow
[2024-11-08 17:02:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions.
[2024-11-08 17:02:39,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462
[2024-11-08 17:02:39,984 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions.
[2024-11-08 17:02:39,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow
[2024-11-08 17:02:39,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:39,989 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow
[2024-11-08 17:02:39,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=161, PETRI_TRANSITIONS=157}
[2024-11-08 17:02:39,990 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places.
[2024-11-08 17:02:39,990 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow
[2024-11-08 17:02:39,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-08 17:02:39,991 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:39,991 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:40,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 17:02:40,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-11-08 17:02:40,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:40,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash 998651469, now seen corresponding path program 1 times
[2024-11-08 17:02:40,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:40,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842981598]
[2024-11-08 17:02:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:40,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:40,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:40,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842981598]
[2024-11-08 17:02:40,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842981598] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:02:40,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802210957]
[2024-11-08 17:02:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:40,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:02:40,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 17:02:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:40,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:02:40,561 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:02:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-08 17:02:40,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:02:40,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802210957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:02:40,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 17:02:40,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2024-11-08 17:02:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730152788]
[2024-11-08 17:02:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:02:40,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:02:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:02:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:02:40,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188
[2024-11-08 17:02:40,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-08 17:02:40,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:40,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188
[2024-11-08 17:02:40,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:40,767 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events.
[2024-11-08 17:02:40,768 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES.
[2024-11-08 17:02:40,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 601 events. 78/601 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2732 event pairs, 0 based on Foata normal form. 8/564 useless extension candidates. Maximal degree in co-relation 865. Up to 59 conditions per place.
[2024-11-08 17:02:40,777 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions.
[2024-11-08 17:02:40,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow
[2024-11-08 17:02:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:02:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:02:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions.
[2024-11-08 17:02:40,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362
[2024-11-08 17:02:40,780 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions.
[2024-11-08 17:02:40,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow
[2024-11-08 17:02:40,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:40,786 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow
[2024-11-08 17:02:40,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=163, PETRI_TRANSITIONS=163}
[2024-11-08 17:02:40,787 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places.
[2024-11-08 17:02:40,787 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow
[2024-11-08 17:02:40,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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-08 17:02:40,788 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:40,788 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:40,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 17:02:40,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:40,993 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:40,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1246294565, now seen corresponding path program 1 times
[2024-11-08 17:02:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339862252]
[2024-11-08 17:02:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:41,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339862252]
[2024-11-08 17:02:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339862252] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:02:41,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206210303]
[2024-11-08 17:02:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:41,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:41,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:02:41,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 17:02:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:41,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:02:41,347 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:02:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:41,568 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:02:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:41,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206210303] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:02:41,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:02:41,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2024-11-08 17:02:41,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083858913]
[2024-11-08 17:02:41,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:02:41,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 17:02:41,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 17:02:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-11-08 17:02:41,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188
[2024-11-08 17:02:41,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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-08 17:02:41,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:41,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188
[2024-11-08 17:02:41,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:42,293 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events.
[2024-11-08 17:02:42,294 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES.
[2024-11-08 17:02:42,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 1310 events. 242/1310 cut-off events. For 1036/1068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6597 event pairs, 13 based on Foata normal form. 16/1267 useless extension candidates. Maximal degree in co-relation 2346. Up to 138 conditions per place.
[2024-11-08 17:02:42,311 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions.
[2024-11-08 17:02:42,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow
[2024-11-08 17:02:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 17:02:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 17:02:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions.
[2024-11-08 17:02:42,317 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981
[2024-11-08 17:02:42,317 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions.
[2024-11-08 17:02:42,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow
[2024-11-08 17:02:42,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:02:42,327 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow
[2024-11-08 17:02:42,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=172, PETRI_TRANSITIONS=169}
[2024-11-08 17:02:42,328 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places.
[2024-11-08 17:02:42,328 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow
[2024-11-08 17:02:42,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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-08 17:02:42,330 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:42,330 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:42,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 17:02:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:42,538 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:42,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash -606596741, now seen corresponding path program 2 times
[2024-11-08 17:02:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:42,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620636696]
[2024-11-08 17:02:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:42,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620636696]
[2024-11-08 17:02:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620636696] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:02:43,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127997010]
[2024-11-08 17:02:43,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:02:43,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:43,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:43,041 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:02:43,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 17:02:43,198 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:02:43,198 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:02:43,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:02:43,209 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:02:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:43,532 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:02:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127997010] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:02:43,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:02:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18
[2024-11-08 17:02:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768387420]
[2024-11-08 17:02:43,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:02:43,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-11-08 17:02:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:43,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-11-08 17:02:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306
[2024-11-08 17:02:44,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188
[2024-11-08 17:02:44,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 446 flow. Second operand has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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-08 17:02:44,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:44,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188
[2024-11-08 17:02:44,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:45,020 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events.
[2024-11-08 17:02:45,020 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES.
[2024-11-08 17:02:45,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2170 events. 402/2170 cut-off events. For 1539/1571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10604 event pairs, 13 based on Foata normal form. 26/2135 useless extension candidates. Maximal degree in co-relation 3911. Up to 218 conditions per place.
[2024-11-08 17:02:45,049 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions.
[2024-11-08 17:02:45,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow
[2024-11-08 17:02:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-11-08 17:02:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-11-08 17:02:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions.
[2024-11-08 17:02:45,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761
[2024-11-08 17:02:45,061 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions.
[2024-11-08 17:02:45,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow
[2024-11-08 17:02:45,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places.
[2024-11-08 17:02:45,070 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow
[2024-11-08 17:02:45,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=570, PETRI_PLACES=196, PETRI_TRANSITIONS=182}
[2024-11-08 17:02:45,071 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places.
[2024-11-08 17:02:45,071 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow
[2024-11-08 17:02:45,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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-08 17:02:45,073 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:45,073 INFO L204 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:45,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 17:02:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:45,274 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:45,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 778137787, now seen corresponding path program 3 times
[2024-11-08 17:02:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:45,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81247654]
[2024-11-08 17:02:45,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:46,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:46,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81247654]
[2024-11-08 17:02:46,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81247654] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:02:46,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704704398]
[2024-11-08 17:02:46,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 17:02:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:46,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:46,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:02:46,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 17:02:46,177 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s)
[2024-11-08 17:02:46,177 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:02:46,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:02:46,190 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:02:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:46,697 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:02:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704704398] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:02:47,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:02:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34
[2024-11-08 17:02:47,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245698251]
[2024-11-08 17:02:47,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:02:47,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-11-08 17:02:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-11-08 17:02:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122
[2024-11-08 17:02:47,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188
[2024-11-08 17:02:47,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 570 flow. Second operand has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 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-08 17:02:47,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:47,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188
[2024-11-08 17:02:47,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:50,186 INFO L124 PetriNetUnfolderBase]: 722/3890 cut-off events.
[2024-11-08 17:02:50,187 INFO L125 PetriNetUnfolderBase]: For 4577/4609 co-relation queries the response was YES.
[2024-11-08 17:02:50,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 3890 events. 722/3890 cut-off events. For 4577/4609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 18669 event pairs, 13 based on Foata normal form. 46/3875 useless extension candidates. Maximal degree in co-relation 7457. Up to 378 conditions per place.
[2024-11-08 17:02:50,241 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 291 selfloop transitions, 45 changer transitions 0/477 dead transitions.
[2024-11-08 17:02:50,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 477 transitions, 3078 flow
[2024-11-08 17:02:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2024-11-08 17:02:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2024-11-08 17:02:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7321 transitions.
[2024-11-08 17:02:50,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8653664302600473
[2024-11-08 17:02:50,259 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 45 states and 7321 transitions.
[2024-11-08 17:02:50,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 477 transitions, 3078 flow
[2024-11-08 17:02:50,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 477 transitions, 3038 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-11-08 17:02:50,278 INFO L231 Difference]: Finished difference. Result has 243 places, 207 transitions, 848 flow
[2024-11-08 17:02:50,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=848, PETRI_PLACES=243, PETRI_TRANSITIONS=207}
[2024-11-08 17:02:50,279 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 59 predicate places.
[2024-11-08 17:02:50,279 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 207 transitions, 848 flow
[2024-11-08 17:02:50,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 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-08 17:02:50,282 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:50,282 INFO L204 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:50,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-08 17:02:50,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:50,483 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:50,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1476844451, now seen corresponding path program 4 times
[2024-11-08 17:02:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:50,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102810176]
[2024-11-08 17:02:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:50,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:02:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:53,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:02:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102810176]
[2024-11-08 17:02:53,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102810176] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:02:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051946743]
[2024-11-08 17:02:53,038 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:02:53,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:53,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:02:53,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:02:53,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 17:02:53,303 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:02:53,303 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:02:53,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-08 17:02:53,318 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:02:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:54,540 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:02:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:02:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051946743] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:02:56,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:02:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 35
[2024-11-08 17:02:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021331128]
[2024-11-08 17:02:56,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:02:56,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-11-08 17:02:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:02:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-11-08 17:02:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190
[2024-11-08 17:02:56,021 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188
[2024-11-08 17:02:56,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 848 flow. Second operand has 35 states, 35 states have (on average 161.11428571428573) internal successors, (5639), 35 states have internal predecessors, (5639), 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-08 17:02:56,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:02:56,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188
[2024-11-08 17:02:56,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:02:58,718 INFO L124 PetriNetUnfolderBase]: 762/4105 cut-off events.
[2024-11-08 17:02:58,718 INFO L125 PetriNetUnfolderBase]: For 5376/5408 co-relation queries the response was YES.
[2024-11-08 17:02:58,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8192 conditions, 4105 events. 762/4105 cut-off events. For 5376/5408 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 19677 event pairs, 13 based on Foata normal form. 11/4055 useless extension candidates. Maximal degree in co-relation 8168. Up to 398 conditions per place.
[2024-11-08 17:02:58,786 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 310 selfloop transitions, 48 changer transitions 0/499 dead transitions.
[2024-11-08 17:02:58,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 499 transitions, 3378 flow
[2024-11-08 17:02:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2024-11-08 17:02:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2024-11-08 17:02:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 7801 transitions.
[2024-11-08 17:02:58,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8644725177304965
[2024-11-08 17:02:58,802 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 848 flow. Second operand 48 states and 7801 transitions.
[2024-11-08 17:02:58,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 499 transitions, 3378 flow
[2024-11-08 17:02:58,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 499 transitions, 3320 flow, removed 11 selfloop flow, removed 18 redundant places.
[2024-11-08 17:02:58,829 INFO L231 Difference]: Finished difference. Result has 276 places, 211 transitions, 946 flow
[2024-11-08 17:02:58,830 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=946, PETRI_PLACES=276, PETRI_TRANSITIONS=211}
[2024-11-08 17:02:58,831 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 92 predicate places.
[2024-11-08 17:02:58,831 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 211 transitions, 946 flow
[2024-11-08 17:02:58,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 161.11428571428573) internal successors, (5639), 35 states have internal predecessors, (5639), 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-08 17:02:58,835 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:02:58,835 INFO L204 CegarLoopForPetriNet]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 17:02:58,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-08 17:02:59,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:02:59,040 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] ===
[2024-11-08 17:02:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:02:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1764161254, now seen corresponding path program 5 times
[2024-11-08 17:02:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:02:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441083836]
[2024-11-08 17:02:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:02:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:02:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:02:59,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:02:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:02:59,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:02:59,741 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:02:59,743 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining)
[2024-11-08 17:02:59,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining)
[2024-11-08 17:02:59,745 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining)
[2024-11-08 17:02:59,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining)
[2024-11-08 17:02:59,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining)
[2024-11-08 17:02:59,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining)
[2024-11-08 17:02:59,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining)
[2024-11-08 17:02:59,746 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining)
[2024-11-08 17:02:59,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining)
[2024-11-08 17:02:59,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining)
[2024-11-08 17:02:59,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining)
[2024-11-08 17:02:59,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining)
[2024-11-08 17:02:59,747 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining)
[2024-11-08 17:02:59,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining)
[2024-11-08 17:02:59,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining)
[2024-11-08 17:02:59,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining)
[2024-11-08 17:02:59,748 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining)
[2024-11-08 17:02:59,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining)
[2024-11-08 17:02:59,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining)
[2024-11-08 17:02:59,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining)
[2024-11-08 17:02:59,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining)
[2024-11-08 17:02:59,749 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining)
[2024-11-08 17:02:59,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining)
[2024-11-08 17:02:59,750 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining)
[2024-11-08 17:02:59,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining)
[2024-11-08 17:02:59,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining)
[2024-11-08 17:02:59,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining)
[2024-11-08 17:02:59,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining)
[2024-11-08 17:02:59,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining)
[2024-11-08 17:02:59,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining)
[2024-11-08 17:02:59,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining)
[2024-11-08 17:02:59,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining)
[2024-11-08 17:02:59,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining)
[2024-11-08 17:02:59,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining)
[2024-11-08 17:02:59,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining)
[2024-11-08 17:02:59,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining)
[2024-11-08 17:02:59,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining)
[2024-11-08 17:02:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining)
[2024-11-08 17:02:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining)
[2024-11-08 17:02:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining)
[2024-11-08 17:02:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining)
[2024-11-08 17:02:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining)
[2024-11-08 17:02:59,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining)
[2024-11-08 17:02:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining)
[2024-11-08 17:02:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining)
[2024-11-08 17:02:59,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining)
[2024-11-08 17:02:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-11-08 17:02:59,756 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:03:00,137 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 17:03:00,137 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:03:00,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:03:00 BasicIcfg
[2024-11-08 17:03:00,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:03:00,144 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:03:00,144 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:03:00,145 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 17:03:00,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:02:34" (3/4) ...
[2024-11-08 17:03:00,147 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-08 17:03:00,484 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 17:03:00,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:03:00,485 INFO L158 Benchmark]: Toolchain (without parser) took 28041.72ms. Allocated memory was 161.5MB in the beginning and 490.7MB in the end (delta: 329.3MB). Free memory was 128.4MB in the beginning and 265.6MB in the end (delta: -137.2MB). Peak memory consumption was 354.4MB. Max. memory is 16.1GB.
[2024-11-08 17:03:00,485 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 161.5MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:03:00,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 878.64ms. Allocated memory is still 161.5MB. Free memory was 128.4MB in the beginning and 105.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-11-08 17:03:00,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.21ms. Allocated memory is still 161.5MB. Free memory was 105.4MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 17:03:00,486 INFO L158 Benchmark]: Boogie Preprocessor took 45.24ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 102.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:03:00,487 INFO L158 Benchmark]: RCFGBuilder took 817.75ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 78.9MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-08 17:03:00,487 INFO L158 Benchmark]: TraceAbstraction took 25882.65ms. Allocated memory was 161.5MB in the beginning and 490.7MB in the end (delta: 329.3MB). Free memory was 78.2MB in the beginning and 156.5MB in the end (delta: -78.4MB). Peak memory consumption was 282.0MB. Max. memory is 16.1GB.
[2024-11-08 17:03:00,487 INFO L158 Benchmark]: Witness Printer took 340.35ms. Allocated memory is still 490.7MB. Free memory was 156.5MB in the beginning and 265.6MB in the end (delta: -109.1MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB.
[2024-11-08 17:03:00,489 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.48ms. Allocated memory is still 161.5MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 878.64ms. Allocated memory is still 161.5MB. Free memory was 128.4MB in the beginning and 105.4MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 67.21ms. Allocated memory is still 161.5MB. Free memory was 105.4MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 45.24ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 102.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 817.75ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 78.9MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 25882.65ms. Allocated memory was 161.5MB in the beginning and 490.7MB in the end (delta: 329.3MB). Free memory was 78.2MB in the beginning and 156.5MB in the end (delta: -78.4MB). Peak memory consumption was 282.0MB. Max. memory is 16.1GB.
* Witness Printer took 340.35ms. Allocated memory is still 490.7MB. Free memory was 156.5MB in the beginning and 265.6MB in the end (delta: -109.1MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- DataRaceFoundResult [Line: 725]: Data race detected
Data race detected
The following path leads to a data race:
[L683] 0 int i, j;
VAL [i=0, j=0]
[L686] 0 int p, q;
VAL [i=0, j=0, p=0, q=0]
[L703] 0 int cur = 1, prev = 0, next = 0;
VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0]
[L704] 0 int x;
VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0]
[L714] 0 pthread_t id1, id2;
VAL [\old(argc)=1643, \old(argv)={1641:1604}, argc=1643, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0]
[L716] 0 i = 1
VAL [\old(argc)=1643, \old(argv)={1641:1604}, argc=1643, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0]
[L719] 0 j = 1
VAL [\old(argc)=1643, \old(argv)={1641:1604}, argc=1643, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0))
VAL [\old(arg)={0:0}, \old(argc)=1643, \old(argv)={1641:1604}, argc=1643, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L688] 1 p = 0
VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L688] 1 p < 7
VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L688] COND TRUE 1 p < 7
VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1643, \old(argv)={1641:1604}, arg={0:0}, argc=1643, cur=1, i=1, id1=-1, id2=0, j=1, next=0, p=0, prev=0, q=0, x=0]
[L723] CALL, EXPR 0 fib()
[L706] 0 x = 0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15]
[L706] COND TRUE 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15]
[L707] EXPR 0 prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15]
[L707] 0 next = prev + cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15]
[L708] 0 prev = cur
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15]
[L709] 0 cur = next
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15]
[L706] 0 x++
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L706] 0 x < 16
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L706] COND FALSE 0 !(x < 16)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L711] 0 return prev;
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=987, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L723] RET, EXPR 0 fib()
[L723] 0 int correct = fib();
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1643, \old(argv)={1641:1604}, arg={0:0}, argc=1643, correct=987, cur=1597, i=1, id1=-1, id2=0, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L725] 0 i < correct
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1643, \old(argv)={1641:1604}, arg={0:0}, argc=1643, correct=987, cur=1597, i=1, id1=-1, id2=0, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L690] EXPR 1 i + j
[L690] 1 i = i + j
VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=2, j=1, next=1597, p=0, prev=987, q=0, x=16]
[L725] 0 i < correct
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=1643, \old(argv)={1641:1604}, arg={0:0}, argc=1643, correct=987, cur=1597, i=2, id1=-1, id2=0, j=1, next=1597, p=0, prev=987, q=0, x=16]
Now there is a data race on ~i~0 between
C: i = i + j [690]
and
C: i < correct [725]
- UnprovableResult [Line: 716]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 719]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 706]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 706]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 711]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 707]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 707]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 707]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 708]: 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: 708]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 709]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 709]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 706]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 706]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 688]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 688]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 690]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 690]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 690]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 688]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 688]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 696]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 696]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 698]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 698]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 698]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 696]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 696]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 240 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.3s, OverallIterations: 24, TraceHistogramMax: 17, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1292 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1078 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1101 IncrementalHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 93 mSDtfsCounter, 1101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 2478 SyntacticMatches, 31 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2620 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=23, InterpolantAutomatonStates: 179, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 4149 NumberOfCodeBlocks, 4149 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4661 ConstructedInterpolants, 0 QuantifiedInterpolants, 10505 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-08 17:03:00,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f22496da-8b74-4f76-904f-db10411afb52/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE