./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b 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_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37f99419c791b8329e91533415d896c367c9197a331e0ac4d97f5b27dc6c2be9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:24:35,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:24:35,340 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 22:24:35,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:24:35,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:24:35,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:24:35,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:24:35,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:24:35,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:24:35,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:24:35,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:24:35,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:24:35,401 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:24:35,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:24:35,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:24:35,404 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:24:35,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:24:35,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:24:35,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:24:35,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:24:35,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:24:35,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:24:35,407 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 22:24:35,408 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:24:35,408 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:24:35,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:24:35,409 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:24:35,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:24:35,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:24:35,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:24:35,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:35,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:24:35,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:24:35,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:24:35,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:24:35,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:24:35,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:24:35,414 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:24:35,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:24:35,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:24:35,414 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:24:35,415 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_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 37f99419c791b8329e91533415d896c367c9197a331e0ac4d97f5b27dc6c2be9 [2023-11-06 22:24:35,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:24:35,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:24:35,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:24:35,771 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:24:35,772 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:24:35,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i [2023-11-06 22:24:38,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:24:39,253 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:24:39,253 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/sv-benchmarks/c/pthread-lit/fkp2013_variant-2.i [2023-11-06 22:24:39,281 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/data/d7fc00510/72bccdeb7e6d4e739b304a8d3d3c9007/FLAGa3b0d4025 [2023-11-06 22:24:39,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/data/d7fc00510/72bccdeb7e6d4e739b304a8d3d3c9007 [2023-11-06 22:24:39,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:24:39,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:24:39,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:39,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:24:39,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:24:39,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73798b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39, skipping insertion in model container [2023-11-06 22:24:39,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,361 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:24:39,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:39,779 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:24:39,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:39,888 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:24:39,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39 WrapperNode [2023-11-06 22:24:39,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:39,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:39,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:24:39,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:24:39,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,935 INFO L138 Inliner]: procedures = 172, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2023-11-06 22:24:39,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:39,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:24:39,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:24:39,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:24:39,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:24:39,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:24:39,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:24:39,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:24:39,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (1/1) ... [2023-11-06 22:24:39,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:40,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:24:40,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:24:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-06 22:24:40,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-06 22:24:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 22:24:40,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 22:24:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:24:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:24:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:24:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:24:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:24:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:24:40,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:24:40,054 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:24:40,237 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:24:40,239 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:24:40,419 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:24:40,427 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:24:40,431 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:24:40,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:40 BoogieIcfgContainer [2023-11-06 22:24:40,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:24:40,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:24:40,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:24:40,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:24:40,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:39" (1/3) ... [2023-11-06 22:24:40,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d3a70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:40, skipping insertion in model container [2023-11-06 22:24:40,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:39" (2/3) ... [2023-11-06 22:24:40,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d3a70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:40, skipping insertion in model container [2023-11-06 22:24:40,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:40" (3/3) ... [2023-11-06 22:24:40,443 INFO L112 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-2.i [2023-11-06 22:24:40,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:24:40,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:24:40,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-06 22:24:40,458 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:24:40,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:24:40,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 112 transitions, 232 flow [2023-11-06 22:24:40,638 INFO L124 PetriNetUnfolderBase]: 5/129 cut-off events. [2023-11-06 22:24:40,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 129 events. 5/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 197 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2023-11-06 22:24:40,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 112 transitions, 232 flow [2023-11-06 22:24:40,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 111 transitions, 229 flow [2023-11-06 22:24:40,659 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:24:40,674 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 111 transitions, 229 flow [2023-11-06 22:24:40,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 111 transitions, 229 flow [2023-11-06 22:24:40,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 111 transitions, 229 flow [2023-11-06 22:24:40,730 INFO L124 PetriNetUnfolderBase]: 5/129 cut-off events. [2023-11-06 22:24:40,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:40,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 129 events. 5/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 197 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. [2023-11-06 22:24:40,735 INFO L119 LiptonReduction]: Number of co-enabled transitions 2604 [2023-11-06 22:24:44,286 INFO L134 LiptonReduction]: Checked pairs total: 7289 [2023-11-06 22:24:44,286 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-11-06 22:24:44,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:44,310 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e4ff3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:44,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-06 22:24:44,311 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:24:44,312 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:24:44,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:44,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:44,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:24:44,313 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-06 22:24:44,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:44,317 INFO L85 PathProgramCache]: Analyzing trace with hash 425, now seen corresponding path program 1 times [2023-11-06 22:24:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261041883] [2023-11-06 22:24:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:44,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:44,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261041883] [2023-11-06 22:24:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261041883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:24:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431983335] [2023-11-06 22:24:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:24:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:24:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:24:44,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 230 [2023-11-06 22:24:44,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 65 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:44,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 230 [2023-11-06 22:24:44,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:44,637 INFO L124 PetriNetUnfolderBase]: 82/211 cut-off events. [2023-11-06 22:24:44,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:44,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 211 events. 82/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1064 event pairs, 82 based on Foata normal form. 41/223 useless extension candidates. Maximal degree in co-relation 368. Up to 156 conditions per place. [2023-11-06 22:24:44,642 INFO L140 encePairwiseOnDemand]: 225/230 looper letters, 13 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 22:24:44,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 81 flow [2023-11-06 22:24:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:24:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:24:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2023-11-06 22:24:44,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2023-11-06 22:24:44,659 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 228 transitions. [2023-11-06 22:24:44,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 228 transitions. [2023-11-06 22:24:44,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:44,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 228 transitions. [2023-11-06 22:24:44,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 114.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,673 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,675 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 65 flow. Second operand 2 states and 228 transitions. [2023-11-06 22:24:44,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 81 flow [2023-11-06 22:24:44,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:44,681 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 54 flow [2023-11-06 22:24:44,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2023-11-06 22:24:44,687 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2023-11-06 22:24:44,687 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 54 flow [2023-11-06 22:24:44,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:44,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:24:44,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:24:44,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-06 22:24:44,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 13210508, now seen corresponding path program 1 times [2023-11-06 22:24:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131389824] [2023-11-06 22:24:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131389824] [2023-11-06 22:24:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131389824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:44,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150878787] [2023-11-06 22:24:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:44,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:44,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 230 [2023-11-06 22:24:44,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:44,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 230 [2023-11-06 22:24:44,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:44,965 INFO L124 PetriNetUnfolderBase]: 173/387 cut-off events. [2023-11-06 22:24:44,966 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:24:44,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 387 events. 173/387 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2113 event pairs, 58 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 715. Up to 227 conditions per place. [2023-11-06 22:24:44,974 INFO L140 encePairwiseOnDemand]: 224/230 looper letters, 22 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2023-11-06 22:24:44,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 127 flow [2023-11-06 22:24:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:24:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-11-06 22:24:44,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4623188405797101 [2023-11-06 22:24:44,983 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-11-06 22:24:44,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-11-06 22:24:44,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:44,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-11-06 22:24:44,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,992 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 3 states and 319 transitions. [2023-11-06 22:24:44,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 127 flow [2023-11-06 22:24:44,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:44,997 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 82 flow [2023-11-06 22:24:44,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-11-06 22:24:44,999 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-11-06 22:24:45,000 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 82 flow [2023-11-06 22:24:45,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:45,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:24:45,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:24:45,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-06 22:24:45,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash 409571046, now seen corresponding path program 1 times [2023-11-06 22:24:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129438119] [2023-11-06 22:24:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:45,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129438119] [2023-11-06 22:24:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129438119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:45,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097297891] [2023-11-06 22:24:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:45,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:45,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 230 [2023-11-06 22:24:45,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:45,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 230 [2023-11-06 22:24:45,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:45,244 INFO L124 PetriNetUnfolderBase]: 256/516 cut-off events. [2023-11-06 22:24:45,244 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-11-06 22:24:45,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 516 events. 256/516 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2473 event pairs, 241 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 1152. Up to 452 conditions per place. [2023-11-06 22:24:45,249 INFO L140 encePairwiseOnDemand]: 227/230 looper letters, 17 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2023-11-06 22:24:45,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 114 flow [2023-11-06 22:24:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:24:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-11-06 22:24:45,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391304347826087 [2023-11-06 22:24:45,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-11-06 22:24:45,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-11-06 22:24:45,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:45,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-11-06 22:24:45,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,259 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 82 flow. Second operand 3 states and 303 transitions. [2023-11-06 22:24:45,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 114 flow [2023-11-06 22:24:45,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:24:45,265 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 72 flow [2023-11-06 22:24:45,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-11-06 22:24:45,267 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-06 22:24:45,267 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 72 flow [2023-11-06 22:24:45,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:45,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:45,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:24:45,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2023-11-06 22:24:45,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1439916936, now seen corresponding path program 1 times [2023-11-06 22:24:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103775202] [2023-11-06 22:24:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:45,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:45,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:24:45,342 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:45,343 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2023-11-06 22:24:45,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2023-11-06 22:24:45,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2023-11-06 22:24:45,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2023-11-06 22:24:45,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2023-11-06 22:24:45,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2023-11-06 22:24:45,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2023-11-06 22:24:45,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2023-11-06 22:24:45,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2023-11-06 22:24:45,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 14 remaining) [2023-11-06 22:24:45,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2023-11-06 22:24:45,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2023-11-06 22:24:45,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2023-11-06 22:24:45,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2023-11-06 22:24:45,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:24:45,349 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:24:45,352 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:24:45,352 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 22:24:45,380 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:24:45,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 151 transitions, 322 flow [2023-11-06 22:24:45,422 INFO L124 PetriNetUnfolderBase]: 6/167 cut-off events. [2023-11-06 22:24:45,422 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:24:45,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 167 events. 6/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 174. Up to 6 conditions per place. [2023-11-06 22:24:45,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 151 transitions, 322 flow [2023-11-06 22:24:45,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 126 transitions, 265 flow [2023-11-06 22:24:45,427 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:24:45,427 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 126 transitions, 265 flow [2023-11-06 22:24:45,428 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 126 transitions, 265 flow [2023-11-06 22:24:45,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 126 transitions, 265 flow [2023-11-06 22:24:45,470 INFO L124 PetriNetUnfolderBase]: 6/167 cut-off events. [2023-11-06 22:24:45,471 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:24:45,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 167 events. 6/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 278 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 132. Up to 6 conditions per place. [2023-11-06 22:24:45,477 INFO L119 LiptonReduction]: Number of co-enabled transitions 4386 [2023-11-06 22:24:48,520 INFO L134 LiptonReduction]: Checked pairs total: 15167 [2023-11-06 22:24:48,521 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-11-06 22:24:48,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:48,524 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e4ff3b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:48,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-06 22:24:48,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:24:48,526 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:24:48,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:24:48,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:48,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:24:48,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-11-06 22:24:48,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 728, now seen corresponding path program 1 times [2023-11-06 22:24:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:48,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364444938] [2023-11-06 22:24:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:48,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:48,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364444938] [2023-11-06 22:24:48,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364444938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:48,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:48,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:24:48,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468026893] [2023-11-06 22:24:48,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:48,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:24:48,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:48,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:24:48,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:24:48,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 263 [2023-11-06 22:24:48,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 93 flow. Second operand has 2 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:48,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 263 [2023-11-06 22:24:48,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:48,723 INFO L124 PetriNetUnfolderBase]: 445/994 cut-off events. [2023-11-06 22:24:48,724 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-06 22:24:48,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 994 events. 445/994 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6601 event pairs, 445 based on Foata normal form. 146/1000 useless extension candidates. Maximal degree in co-relation 1730. Up to 699 conditions per place. [2023-11-06 22:24:48,736 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 16 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-11-06 22:24:48,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 115 flow [2023-11-06 22:24:48,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:24:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:24:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2023-11-06 22:24:48,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5684410646387833 [2023-11-06 22:24:48,740 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2023-11-06 22:24:48,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2023-11-06 22:24:48,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:48,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2023-11-06 22:24:48,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,746 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,746 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 93 flow. Second operand 2 states and 299 transitions. [2023-11-06 22:24:48,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 115 flow [2023-11-06 22:24:48,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:48,749 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 82 flow [2023-11-06 22:24:48,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-06 22:24:48,750 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-06 22:24:48,751 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 82 flow [2023-11-06 22:24:48,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:48,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:24:48,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:24:48,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-11-06 22:24:48,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash 22482046, now seen corresponding path program 1 times [2023-11-06 22:24:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852707526] [2023-11-06 22:24:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:48,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:48,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852707526] [2023-11-06 22:24:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852707526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:48,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683062864] [2023-11-06 22:24:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:48,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:48,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:48,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:48,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 263 [2023-11-06 22:24:48,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:48,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 263 [2023-11-06 22:24:48,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:49,242 INFO L124 PetriNetUnfolderBase]: 1817/3455 cut-off events. [2023-11-06 22:24:49,242 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-06 22:24:49,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 3455 events. 1817/3455 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 26323 event pairs, 744 based on Foata normal form. 0/2937 useless extension candidates. Maximal degree in co-relation 6343. Up to 1653 conditions per place. [2023-11-06 22:24:49,276 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 31 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2023-11-06 22:24:49,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 202 flow [2023-11-06 22:24:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:24:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-11-06 22:24:49,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247148288973384 [2023-11-06 22:24:49,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-11-06 22:24:49,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-11-06 22:24:49,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:49,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-11-06 22:24:49,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,287 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 82 flow. Second operand 3 states and 414 transitions. [2023-11-06 22:24:49,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 202 flow [2023-11-06 22:24:49,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:24:49,292 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 152 flow [2023-11-06 22:24:49,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-06 22:24:49,297 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2023-11-06 22:24:49,297 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 152 flow [2023-11-06 22:24:49,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:49,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:24:49,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:24:49,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-11-06 22:24:49,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 696974392, now seen corresponding path program 1 times [2023-11-06 22:24:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:49,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8188725] [2023-11-06 22:24:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:49,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:49,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8188725] [2023-11-06 22:24:49,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8188725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:49,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51063548] [2023-11-06 22:24:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:49,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:49,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 263 [2023-11-06 22:24:49,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:49,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 263 [2023-11-06 22:24:49,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:49,899 INFO L124 PetriNetUnfolderBase]: 2467/4688 cut-off events. [2023-11-06 22:24:49,899 INFO L125 PetriNetUnfolderBase]: For 2369/2408 co-relation queries the response was YES. [2023-11-06 22:24:49,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10822 conditions, 4688 events. 2467/4688 cut-off events. For 2369/2408 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 35055 event pairs, 1987 based on Foata normal form. 0/4196 useless extension candidates. Maximal degree in co-relation 10815. Up to 3438 conditions per place. [2023-11-06 22:24:49,949 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 23 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-11-06 22:24:49,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 196 flow [2023-11-06 22:24:49,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:24:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-11-06 22:24:49,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057034220532319 [2023-11-06 22:24:49,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-11-06 22:24:49,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-11-06 22:24:49,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:49,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-11-06 22:24:49,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,962 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 152 flow. Second operand 3 states and 399 transitions. [2023-11-06 22:24:49,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 196 flow [2023-11-06 22:24:49,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:24:49,988 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 134 flow [2023-11-06 22:24:49,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-11-06 22:24:49,990 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-11-06 22:24:49,990 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 134 flow [2023-11-06 22:24:49,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:49,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:49,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:24:49,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-11-06 22:24:49,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1806348953, now seen corresponding path program 1 times [2023-11-06 22:24:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455145967] [2023-11-06 22:24:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:50,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455145967] [2023-11-06 22:24:50,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455145967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:50,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:50,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714210441] [2023-11-06 22:24:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:50,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:50,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:50,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:50,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 263 [2023-11-06 22:24:50,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:50,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:50,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 263 [2023-11-06 22:24:50,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:50,506 INFO L124 PetriNetUnfolderBase]: 1600/3273 cut-off events. [2023-11-06 22:24:50,507 INFO L125 PetriNetUnfolderBase]: For 740/786 co-relation queries the response was YES. [2023-11-06 22:24:50,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6877 conditions, 3273 events. 1600/3273 cut-off events. For 740/786 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 25701 event pairs, 913 based on Foata normal form. 0/2698 useless extension candidates. Maximal degree in co-relation 6870. Up to 1919 conditions per place. [2023-11-06 22:24:50,547 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 26 selfloop transitions, 9 changer transitions 0/54 dead transitions. [2023-11-06 22:24:50,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 247 flow [2023-11-06 22:24:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:24:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-11-06 22:24:50,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221799746514575 [2023-11-06 22:24:50,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-11-06 22:24:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-11-06 22:24:50,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:50,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-11-06 22:24:50,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:50,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:50,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:50,557 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 134 flow. Second operand 3 states and 412 transitions. [2023-11-06 22:24:50,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 247 flow [2023-11-06 22:24:50,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:50,561 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 202 flow [2023-11-06 22:24:50,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2023-11-06 22:24:50,563 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2023-11-06 22:24:50,564 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 202 flow [2023-11-06 22:24:50,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:50,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:50,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:50,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:24:50,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2023-11-06 22:24:50,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash -443935390, now seen corresponding path program 1 times [2023-11-06 22:24:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086624456] [2023-11-06 22:24:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:50,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:50,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:24:50,631 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:50,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining) [2023-11-06 22:24:50,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2023-11-06 22:24:50,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2023-11-06 22:24:50,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2023-11-06 22:24:50,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2023-11-06 22:24:50,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2023-11-06 22:24:50,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2023-11-06 22:24:50,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2023-11-06 22:24:50,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2023-11-06 22:24:50,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-11-06 22:24:50,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-11-06 22:24:50,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2023-11-06 22:24:50,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2023-11-06 22:24:50,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2023-11-06 22:24:50,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2023-11-06 22:24:50,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2023-11-06 22:24:50,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2023-11-06 22:24:50,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2023-11-06 22:24:50,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:24:50,636 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:24:50,643 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-06 22:24:50,643 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:24:50,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:50 BasicIcfg [2023-11-06 22:24:50,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:24:50,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:24:50,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:24:50,697 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:24:50,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:40" (3/4) ... [2023-11-06 22:24:50,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:24:50,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:24:50,702 INFO L158 Benchmark]: Toolchain (without parser) took 11400.61ms. Allocated memory was 148.9MB in the beginning and 220.2MB in the end (delta: 71.3MB). Free memory was 105.3MB in the beginning and 179.1MB in the end (delta: -73.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:50,702 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 102.8MB. Free memory was 53.8MB in the beginning and 53.6MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:50,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.10ms. Allocated memory is still 148.9MB. Free memory was 105.3MB in the beginning and 85.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.30ms. Allocated memory is still 148.9MB. Free memory was 85.6MB in the beginning and 83.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,703 INFO L158 Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 148.9MB. Free memory was 83.6MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,704 INFO L158 Benchmark]: RCFGBuilder took 467.99ms. Allocated memory is still 148.9MB. Free memory was 82.0MB in the beginning and 112.7MB in the end (delta: -30.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,704 INFO L158 Benchmark]: TraceAbstraction took 10259.06ms. Allocated memory was 148.9MB in the beginning and 220.2MB in the end (delta: 71.3MB). Free memory was 112.2MB in the beginning and 179.1MB in the end (delta: -66.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,704 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 220.2MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:50,708 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.31ms. Allocated memory is still 102.8MB. Free memory was 53.8MB in the beginning and 53.6MB in the end (delta: 142.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.10ms. Allocated memory is still 148.9MB. Free memory was 105.3MB in the beginning and 85.6MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.30ms. Allocated memory is still 148.9MB. Free memory was 85.6MB in the beginning and 83.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.04ms. Allocated memory is still 148.9MB. Free memory was 83.6MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 467.99ms. Allocated memory is still 148.9MB. Free memory was 82.0MB in the beginning and 112.7MB in the end (delta: -30.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10259.06ms. Allocated memory was 148.9MB in the beginning and 220.2MB in the end (delta: 71.3MB). Free memory was 112.2MB in the beginning and 179.1MB in the end (delta: -66.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 220.2MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 113 PlacesBefore, 33 PlacesAfterwards, 111 TransitionsBefore, 29 TransitionsAfterwards, 2604 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 118 TotalNumberOfCompositions, 7289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3535, independent: 3279, independent conditional: 0, independent unconditional: 3279, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1536, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3535, independent: 1776, independent conditional: 0, independent unconditional: 1776, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 1536, unknown conditional: 0, unknown unconditional: 1536] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 130 PlacesBefore, 46 PlacesAfterwards, 126 TransitionsBefore, 40 TransitionsAfterwards, 4386 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 15167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7012, independent: 6641, independent conditional: 0, independent unconditional: 6641, dependent: 371, dependent conditional: 0, dependent unconditional: 371, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2503, independent: 2448, independent conditional: 0, independent unconditional: 2448, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7012, independent: 4193, independent conditional: 0, independent unconditional: 4193, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 2503, unknown conditional: 0, unknown unconditional: 2503] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 700]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int x; [L698] 0 volatile int n; [L710] 0 pthread_t t1, t2; [L711] 0 int i; [L712] 0 x = 0 [L713] 0 n = __VERIFIER_nondet_int() [L714] EXPR 0 n > 0 [L714] CALL 0 assume_abort_if_not(n > 0) [L686] COND FALSE 0 !(!cond) [L714] RET 0 assume_abort_if_not(n > 0) [L715] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, n=1, pthread_create(&t1, 0, thr1, 0)=-1, t1={3:0}, t2={5:0}, x=0] [L716] 0 i = 0 VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, n=1, t1={3:0}, t2={5:0}, x=0] [L716] 0 i < n [L716] COND TRUE 0 i < n [L700] 1 x < n VAL [arg={0:0}, arg={0:0}, n=1, x=0] [L717] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=0, n=1, pthread_create(&t2, 0, thr2, 0)=0, t1={3:0}, t2={5:0}, x=0] [L704] 2 int t; [L705] 2 t = x VAL [arg={0:0}, arg={0:0}, n=1, t=0, x=0] [L706] 2 x = t + 1 VAL [arg={0:0}, arg={0:0}, n=1, t=0, x = t + 1=52, x=1] [L700] 1 x < n VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, n=1, t=0, x = t + 1=52, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [706] and C: x < n [700] - UnprovableResult [Line: 705]: 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: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - 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: 715]: 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: 717]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 147 locations, 14 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: 4.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 3 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 184 locations, 18 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: 5.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 48 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:24:50,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5380f88-751d-4525-8c7a-66e26f1b03e5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE