./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:30:45,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:30:45,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:30:45,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:30:45,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:30:45,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:30:45,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:30:45,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:30:45,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:30:45,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:30:45,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:30:45,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:30:45,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:30:45,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:30:45,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:30:45,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:30:45,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:30:45,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:30:45,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:30:45,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:30:45,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:30:45,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:30:45,493 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:30:45,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:30:45,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:30:45,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:30:45,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:30:45,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:30:45,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:30:45,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:30:45,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:30:45,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:30:45,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:30:45,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:30:45,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:30:45,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:30:45,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:30:45,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:30:45,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:30:45,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:30:45,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:30:45,498 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52746884466210ec366bc04a3a6cb03f413619353c73143d79c1024e676e598e [2024-11-10 14:30:45,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:30:45,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:30:45,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:30:45,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:30:45,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:30:45,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-10 14:30:47,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:30:47,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:30:47,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_21-arrayloop2_nr.i [2024-11-10 14:30:47,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be2f2611/0bc9adc0f59746f4b522a9c066b61661/FLAG92f177fa8 [2024-11-10 14:30:47,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be2f2611/0bc9adc0f59746f4b522a9c066b61661 [2024-11-10 14:30:47,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:30:47,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:30:47,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:30:47,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:30:47,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:30:47,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaabf18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47, skipping insertion in model container [2024-11-10 14:30:47,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:30:47,721 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,723 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,725 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,726 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:30:47,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:30:47,801 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,802 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,803 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,803 WARN L1684 CHandler]: Possible shadowing of function new [2024-11-10 14:30:47,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:30:47,894 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:30:47,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47 WrapperNode [2024-11-10 14:30:47,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:30:47,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:30:47,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:30:47,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:30:47,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,942 INFO L138 Inliner]: procedures = 273, calls = 95, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 267 [2024-11-10 14:30:47,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:30:47,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:30:47,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:30:47,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:30:47,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:30:47,977 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:30:47,977 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:30:47,977 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:30:47,978 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (1/1) ... [2024-11-10 14:30:47,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:30:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:30:48,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:30:48,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:30:48,046 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-10 14:30:48,047 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:30:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:30:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:30:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-10 14:30:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:30:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:30:48,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:30:48,049 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:30:48,204 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:30:48,206 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:30:48,645 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:30:48,646 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:30:48,665 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:30:48,665 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:30:48,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:30:48 BoogieIcfgContainer [2024-11-10 14:30:48,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:30:48,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:30:48,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:30:48,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:30:48,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:30:47" (1/3) ... [2024-11-10 14:30:48,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da1060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:30:48, skipping insertion in model container [2024-11-10 14:30:48,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:30:47" (2/3) ... [2024-11-10 14:30:48,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da1060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:30:48, skipping insertion in model container [2024-11-10 14:30:48,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:30:48" (3/3) ... [2024-11-10 14:30:48,673 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_21-arrayloop2_nr.i [2024-11-10 14:30:48,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:30:48,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-10 14:30:48,686 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:30:48,785 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:30:48,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 376 transitions, 760 flow [2024-11-10 14:30:48,936 INFO L124 PetriNetUnfolderBase]: 14/374 cut-off events. [2024-11-10 14:30:48,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:30:48,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 374 events. 14/374 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 616 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 297. Up to 2 conditions per place. [2024-11-10 14:30:48,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 376 transitions, 760 flow [2024-11-10 14:30:48,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 367 places, 374 transitions, 754 flow [2024-11-10 14:30:48,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:30:48,972 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21240714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:30:48,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-10 14:30:48,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:30:48,987 INFO L124 PetriNetUnfolderBase]: 1/108 cut-off events. [2024-11-10 14:30:48,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:30:48,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:48,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:48,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:48,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2014238653, now seen corresponding path program 1 times [2024-11-10 14:30:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282965062] [2024-11-10 14:30:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282965062] [2024-11-10 14:30:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282965062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:49,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:49,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182028796] [2024-11-10 14:30:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:49,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:49,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:49,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:49,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:50,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 376 [2024-11-10 14:30:50,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 374 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:50,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:50,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 376 [2024-11-10 14:30:50,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:50,887 INFO L124 PetriNetUnfolderBase]: 449/1886 cut-off events. [2024-11-10 14:30:50,887 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 14:30:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1886 events. 449/1886 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 11964 event pairs, 342 based on Foata normal form. 154/1833 useless extension candidates. Maximal degree in co-relation 2520. Up to 846 conditions per place. [2024-11-10 14:30:50,901 INFO L140 encePairwiseOnDemand]: 356/376 looper letters, 72 selfloop transitions, 10 changer transitions 0/364 dead transitions. [2024-11-10 14:30:50,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 364 transitions, 898 flow [2024-11-10 14:30:50,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1796 transitions. [2024-11-10 14:30:50,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7960992907801419 [2024-11-10 14:30:50,923 INFO L175 Difference]: Start difference. First operand has 367 places, 374 transitions, 754 flow. Second operand 6 states and 1796 transitions. [2024-11-10 14:30:50,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 364 transitions, 898 flow [2024-11-10 14:30:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 364 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:30:50,935 INFO L231 Difference]: Finished difference. Result has 368 places, 364 transitions, 752 flow [2024-11-10 14:30:50,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=752, PETRI_PLACES=368, PETRI_TRANSITIONS=364} [2024-11-10 14:30:50,942 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 1 predicate places. [2024-11-10 14:30:50,943 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 364 transitions, 752 flow [2024-11-10 14:30:50,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:50,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:50,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:30:50,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:50,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1751548707, now seen corresponding path program 1 times [2024-11-10 14:30:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038133521] [2024-11-10 14:30:50,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038133521] [2024-11-10 14:30:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038133521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850749858] [2024-11-10 14:30:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:51,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:51,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:51,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 376 [2024-11-10 14:30:51,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 364 transitions, 752 flow. Second operand has 6 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:51,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:51,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 376 [2024-11-10 14:30:51,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:52,134 INFO L124 PetriNetUnfolderBase]: 449/1884 cut-off events. [2024-11-10 14:30:52,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:30:52,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2792 conditions, 1884 events. 449/1884 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12012 event pairs, 342 based on Foata normal form. 0/1679 useless extension candidates. Maximal degree in co-relation 2617. Up to 846 conditions per place. [2024-11-10 14:30:52,143 INFO L140 encePairwiseOnDemand]: 364/376 looper letters, 72 selfloop transitions, 10 changer transitions 0/362 dead transitions. [2024-11-10 14:30:52,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 362 transitions, 912 flow [2024-11-10 14:30:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1788 transitions. [2024-11-10 14:30:52,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7925531914893617 [2024-11-10 14:30:52,146 INFO L175 Difference]: Start difference. First operand has 368 places, 364 transitions, 752 flow. Second operand 6 states and 1788 transitions. [2024-11-10 14:30:52,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 362 transitions, 912 flow [2024-11-10 14:30:52,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 362 transitions, 892 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:52,151 INFO L231 Difference]: Finished difference. Result has 366 places, 362 transitions, 748 flow [2024-11-10 14:30:52,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=366, PETRI_TRANSITIONS=362} [2024-11-10 14:30:52,152 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -1 predicate places. [2024-11-10 14:30:52,152 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 362 transitions, 748 flow [2024-11-10 14:30:52,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:52,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:52,154 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:52,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:30:52,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:52,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1992111310, now seen corresponding path program 1 times [2024-11-10 14:30:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:52,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501159855] [2024-11-10 14:30:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501159855] [2024-11-10 14:30:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501159855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:52,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:30:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973596643] [2024-11-10 14:30:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:52,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:30:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:30:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:30:52,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 376 [2024-11-10 14:30:52,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 362 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:52,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:52,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 376 [2024-11-10 14:30:52,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:52,345 INFO L124 PetriNetUnfolderBase]: 29/670 cut-off events. [2024-11-10 14:30:52,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:30:52,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 670 events. 29/670 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2501 event pairs, 18 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 443. Up to 45 conditions per place. [2024-11-10 14:30:52,349 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-10 14:30:52,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 363 transitions, 776 flow [2024-11-10 14:30:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:30:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:30:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2024-11-10 14:30:52,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592198581560284 [2024-11-10 14:30:52,352 INFO L175 Difference]: Start difference. First operand has 366 places, 362 transitions, 748 flow. Second operand 3 states and 1082 transitions. [2024-11-10 14:30:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 363 transitions, 776 flow [2024-11-10 14:30:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 363 transitions, 756 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:52,358 INFO L231 Difference]: Finished difference. Result has 364 places, 363 transitions, 740 flow [2024-11-10 14:30:52,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=364, PETRI_TRANSITIONS=363} [2024-11-10 14:30:52,360 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -3 predicate places. [2024-11-10 14:30:52,360 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 363 transitions, 740 flow [2024-11-10 14:30:52,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:52,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:52,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:52,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:30:52,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1646453930, now seen corresponding path program 1 times [2024-11-10 14:30:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027997773] [2024-11-10 14:30:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:52,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027997773] [2024-11-10 14:30:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027997773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:52,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864349338] [2024-11-10 14:30:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:52,906 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 376 [2024-11-10 14:30:52,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 363 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 285.6666666666667) internal successors, (1714), 6 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:52,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:52,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 376 [2024-11-10 14:30:52,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:53,112 INFO L124 PetriNetUnfolderBase]: 450/2008 cut-off events. [2024-11-10 14:30:53,112 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:30:53,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 2008 events. 450/2008 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12705 event pairs, 342 based on Foata normal form. 0/1799 useless extension candidates. Maximal degree in co-relation 2703. Up to 894 conditions per place. [2024-11-10 14:30:53,120 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 79 selfloop transitions, 5 changer transitions 0/362 dead transitions. [2024-11-10 14:30:53,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 362 transitions, 906 flow [2024-11-10 14:30:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1783 transitions. [2024-11-10 14:30:53,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7903368794326241 [2024-11-10 14:30:53,123 INFO L175 Difference]: Start difference. First operand has 364 places, 363 transitions, 740 flow. Second operand 6 states and 1783 transitions. [2024-11-10 14:30:53,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 362 transitions, 906 flow [2024-11-10 14:30:53,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 362 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:30:53,127 INFO L231 Difference]: Finished difference. Result has 367 places, 362 transitions, 746 flow [2024-11-10 14:30:53,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=367, PETRI_TRANSITIONS=362} [2024-11-10 14:30:53,128 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 0 predicate places. [2024-11-10 14:30:53,128 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 362 transitions, 746 flow [2024-11-10 14:30:53,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 285.6666666666667) internal successors, (1714), 6 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:53,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:53,129 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:30:53,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash -455931315, now seen corresponding path program 1 times [2024-11-10 14:30:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:53,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302425483] [2024-11-10 14:30:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:53,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302425483] [2024-11-10 14:30:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302425483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:30:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167858791] [2024-11-10 14:30:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:30:53,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:30:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:30:53,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 376 [2024-11-10 14:30:53,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 362 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:53,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:53,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 376 [2024-11-10 14:30:53,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:53,267 INFO L124 PetriNetUnfolderBase]: 29/858 cut-off events. [2024-11-10 14:30:53,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:30:53,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 858 events. 29/858 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2476 event pairs, 18 based on Foata normal form. 2/802 useless extension candidates. Maximal degree in co-relation 522. Up to 49 conditions per place. [2024-11-10 14:30:53,271 INFO L140 encePairwiseOnDemand]: 373/376 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-10 14:30:53,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 363 transitions, 774 flow [2024-11-10 14:30:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:30:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:30:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2024-11-10 14:30:53,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592198581560284 [2024-11-10 14:30:53,274 INFO L175 Difference]: Start difference. First operand has 367 places, 362 transitions, 746 flow. Second operand 3 states and 1082 transitions. [2024-11-10 14:30:53,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 363 transitions, 774 flow [2024-11-10 14:30:53,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 363 transitions, 764 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:53,278 INFO L231 Difference]: Finished difference. Result has 365 places, 363 transitions, 748 flow [2024-11-10 14:30:53,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=365, PETRI_TRANSITIONS=363} [2024-11-10 14:30:53,279 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -2 predicate places. [2024-11-10 14:30:53,279 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 363 transitions, 748 flow [2024-11-10 14:30:53,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.0) internal successors, (1074), 3 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:53,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:53,280 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:30:53,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1294612746, now seen corresponding path program 1 times [2024-11-10 14:30:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978888467] [2024-11-10 14:30:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978888467] [2024-11-10 14:30:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978888467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104477085] [2024-11-10 14:30:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:53,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:53,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:54,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 376 [2024-11-10 14:30:54,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 363 transitions, 748 flow. Second operand has 6 states, 6 states have (on average 312.5) internal successors, (1875), 6 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:54,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:54,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 376 [2024-11-10 14:30:54,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:54,290 INFO L124 PetriNetUnfolderBase]: 75/1179 cut-off events. [2024-11-10 14:30:54,290 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:30:54,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1179 events. 75/1179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4690 event pairs, 42 based on Foata normal form. 0/1086 useless extension candidates. Maximal degree in co-relation 970. Up to 263 conditions per place. [2024-11-10 14:30:54,296 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 54 selfloop transitions, 5 changer transitions 0/362 dead transitions. [2024-11-10 14:30:54,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 362 transitions, 864 flow [2024-11-10 14:30:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1908 transitions. [2024-11-10 14:30:54,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8457446808510638 [2024-11-10 14:30:54,299 INFO L175 Difference]: Start difference. First operand has 365 places, 363 transitions, 748 flow. Second operand 6 states and 1908 transitions. [2024-11-10 14:30:54,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 362 transitions, 864 flow [2024-11-10 14:30:54,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 362 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:30:54,303 INFO L231 Difference]: Finished difference. Result has 368 places, 362 transitions, 754 flow [2024-11-10 14:30:54,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=368, PETRI_TRANSITIONS=362} [2024-11-10 14:30:54,305 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 1 predicate places. [2024-11-10 14:30:54,305 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 362 transitions, 754 flow [2024-11-10 14:30:54,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 312.5) internal successors, (1875), 6 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:54,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:54,306 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:54,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:30:54,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:54,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -610884497, now seen corresponding path program 1 times [2024-11-10 14:30:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:54,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722745981] [2024-11-10 14:30:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:54,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:54,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722745981] [2024-11-10 14:30:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722745981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:54,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:54,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087173449] [2024-11-10 14:30:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:54,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:54,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 376 [2024-11-10 14:30:54,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 362 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 288.3333333333333) internal successors, (1730), 6 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:54,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:54,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 376 [2024-11-10 14:30:54,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:55,209 INFO L124 PetriNetUnfolderBase]: 450/2190 cut-off events. [2024-11-10 14:30:55,210 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:30:55,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 2190 events. 450/2190 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12749 event pairs, 342 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 2747. Up to 960 conditions per place. [2024-11-10 14:30:55,220 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 79 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2024-11-10 14:30:55,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 361 transitions, 920 flow [2024-11-10 14:30:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1783 transitions. [2024-11-10 14:30:55,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7903368794326241 [2024-11-10 14:30:55,223 INFO L175 Difference]: Start difference. First operand has 368 places, 362 transitions, 754 flow. Second operand 6 states and 1783 transitions. [2024-11-10 14:30:55,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 361 transitions, 920 flow [2024-11-10 14:30:55,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 361 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:55,228 INFO L231 Difference]: Finished difference. Result has 367 places, 361 transitions, 752 flow [2024-11-10 14:30:55,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=752, PETRI_PLACES=367, PETRI_TRANSITIONS=361} [2024-11-10 14:30:55,229 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 0 predicate places. [2024-11-10 14:30:55,230 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 361 transitions, 752 flow [2024-11-10 14:30:55,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 288.3333333333333) internal successors, (1730), 6 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:55,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:55,231 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:55,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:30:55,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:55,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1902718115, now seen corresponding path program 1 times [2024-11-10 14:30:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:55,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977415248] [2024-11-10 14:30:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977415248] [2024-11-10 14:30:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977415248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:55,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:55,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:55,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992164159] [2024-11-10 14:30:55,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:55,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:55,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:55,939 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 376 [2024-11-10 14:30:55,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 361 transitions, 752 flow. Second operand has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:55,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:55,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 376 [2024-11-10 14:30:55,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:56,207 INFO L124 PetriNetUnfolderBase]: 450/2186 cut-off events. [2024-11-10 14:30:56,207 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:30:56,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3226 conditions, 2186 events. 450/2186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12732 event pairs, 342 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 2763. Up to 944 conditions per place. [2024-11-10 14:30:56,220 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 75 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2024-11-10 14:30:56,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 360 transitions, 910 flow [2024-11-10 14:30:56,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1803 transitions. [2024-11-10 14:30:56,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7992021276595744 [2024-11-10 14:30:56,225 INFO L175 Difference]: Start difference. First operand has 367 places, 361 transitions, 752 flow. Second operand 6 states and 1803 transitions. [2024-11-10 14:30:56,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 360 transitions, 910 flow [2024-11-10 14:30:56,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 360 transitions, 900 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:56,230 INFO L231 Difference]: Finished difference. Result has 366 places, 360 transitions, 750 flow [2024-11-10 14:30:56,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=750, PETRI_PLACES=366, PETRI_TRANSITIONS=360} [2024-11-10 14:30:56,231 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -1 predicate places. [2024-11-10 14:30:56,231 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 360 transitions, 750 flow [2024-11-10 14:30:56,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:56,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:56,232 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:56,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:30:56,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:56,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1338792307, now seen corresponding path program 1 times [2024-11-10 14:30:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790299154] [2024-11-10 14:30:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790299154] [2024-11-10 14:30:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790299154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:56,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:56,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:56,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748427692] [2024-11-10 14:30:56,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:56,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:56,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:56,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 376 [2024-11-10 14:30:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 360 transitions, 750 flow. Second operand has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:56,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:56,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 376 [2024-11-10 14:30:56,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:57,247 INFO L124 PetriNetUnfolderBase]: 450/2182 cut-off events. [2024-11-10 14:30:57,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:30:57,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3222 conditions, 2182 events. 450/2182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12664 event pairs, 342 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 2778. Up to 944 conditions per place. [2024-11-10 14:30:57,257 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 75 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2024-11-10 14:30:57,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 359 transitions, 908 flow [2024-11-10 14:30:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1803 transitions. [2024-11-10 14:30:57,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7992021276595744 [2024-11-10 14:30:57,260 INFO L175 Difference]: Start difference. First operand has 366 places, 360 transitions, 750 flow. Second operand 6 states and 1803 transitions. [2024-11-10 14:30:57,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 359 transitions, 908 flow [2024-11-10 14:30:57,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 359 transitions, 898 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:57,265 INFO L231 Difference]: Finished difference. Result has 365 places, 359 transitions, 748 flow [2024-11-10 14:30:57,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=365, PETRI_TRANSITIONS=359} [2024-11-10 14:30:57,267 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -2 predicate places. [2024-11-10 14:30:57,267 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 359 transitions, 748 flow [2024-11-10 14:30:57,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:57,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:57,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:57,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:30:57,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:57,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:57,269 INFO L85 PathProgramCache]: Analyzing trace with hash -306650898, now seen corresponding path program 1 times [2024-11-10 14:30:57,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:57,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791910012] [2024-11-10 14:30:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:57,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:57,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791910012] [2024-11-10 14:30:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791910012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:57,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:30:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:30:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434278209] [2024-11-10 14:30:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:57,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:30:57,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 376 [2024-11-10 14:30:57,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 359 transitions, 748 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:57,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:57,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 376 [2024-11-10 14:30:57,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:58,125 INFO L124 PetriNetUnfolderBase]: 450/2178 cut-off events. [2024-11-10 14:30:58,126 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:30:58,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 2178 events. 450/2178 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 12580 event pairs, 342 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 2791. Up to 964 conditions per place. [2024-11-10 14:30:58,137 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 80 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2024-11-10 14:30:58,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 358 transitions, 916 flow [2024-11-10 14:30:58,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:30:58,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:30:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1778 transitions. [2024-11-10 14:30:58,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7881205673758865 [2024-11-10 14:30:58,141 INFO L175 Difference]: Start difference. First operand has 365 places, 359 transitions, 748 flow. Second operand 6 states and 1778 transitions. [2024-11-10 14:30:58,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 358 transitions, 916 flow [2024-11-10 14:30:58,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 358 transitions, 906 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:58,146 INFO L231 Difference]: Finished difference. Result has 364 places, 358 transitions, 746 flow [2024-11-10 14:30:58,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=364, PETRI_TRANSITIONS=358} [2024-11-10 14:30:58,147 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, -3 predicate places. [2024-11-10 14:30:58,149 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 358 transitions, 746 flow [2024-11-10 14:30:58,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:58,150 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:58,150 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:58,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:30:58,150 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:58,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash -823777295, now seen corresponding path program 1 times [2024-11-10 14:30:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678652825] [2024-11-10 14:30:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:58,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678652825] [2024-11-10 14:30:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678652825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:30:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339806066] [2024-11-10 14:30:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:58,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:30:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:30:58,305 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:30:58,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:30:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:58,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:30:58,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:30:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:58,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:30:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:30:58,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339806066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:30:58,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:30:58,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:30:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956978258] [2024-11-10 14:30:58,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:30:58,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:30:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:58,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:30:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:30:58,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 376 [2024-11-10 14:30:58,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 358 transitions, 746 flow. Second operand has 10 states, 10 states have (on average 355.0) internal successors, (3550), 10 states have internal predecessors, (3550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:58,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:30:58,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 376 [2024-11-10 14:30:58,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:30:59,024 INFO L124 PetriNetUnfolderBase]: 29/1026 cut-off events. [2024-11-10 14:30:59,024 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 14:30:59,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 1026 events. 29/1026 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1865 event pairs, 18 based on Foata normal form. 4/992 useless extension candidates. Maximal degree in co-relation 515. Up to 49 conditions per place. [2024-11-10 14:30:59,028 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 15 selfloop transitions, 9 changer transitions 0/366 dead transitions. [2024-11-10 14:30:59,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 366 transitions, 812 flow [2024-11-10 14:30:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:30:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:30:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3203 transitions. [2024-11-10 14:30:59,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9465130023640662 [2024-11-10 14:30:59,038 INFO L175 Difference]: Start difference. First operand has 364 places, 358 transitions, 746 flow. Second operand 9 states and 3203 transitions. [2024-11-10 14:30:59,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 366 transitions, 812 flow [2024-11-10 14:30:59,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 366 transitions, 802 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:30:59,044 INFO L231 Difference]: Finished difference. Result has 370 places, 364 transitions, 786 flow [2024-11-10 14:30:59,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=786, PETRI_PLACES=370, PETRI_TRANSITIONS=364} [2024-11-10 14:30:59,045 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 3 predicate places. [2024-11-10 14:30:59,045 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 364 transitions, 786 flow [2024-11-10 14:30:59,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 355.0) internal successors, (3550), 10 states have internal predecessors, (3550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:30:59,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:30:59,047 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:30:59,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:30:59,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 14:30:59,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:30:59,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:30:59,252 INFO L85 PathProgramCache]: Analyzing trace with hash 773357169, now seen corresponding path program 2 times [2024-11-10 14:30:59,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:30:59,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876315036] [2024-11-10 14:30:59,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:30:59,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:30:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:30:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-10 14:30:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:30:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876315036] [2024-11-10 14:30:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876315036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:30:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116166032] [2024-11-10 14:30:59,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:30:59,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:30:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:30:59,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:30:59,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:30:59,836 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 14:30:59,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:30:59,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 14:30:59,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:30:59,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:30:59,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-10 14:30:59,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:30:59,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-10 14:30:59,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:30:59,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-10 14:30:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-10 14:30:59,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:30:59,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116166032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:30:59,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:30:59,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-11-10 14:30:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861972907] [2024-11-10 14:30:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:30:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:30:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:30:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:30:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 14:31:00,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 376 [2024-11-10 14:31:00,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 364 transitions, 786 flow. Second operand has 6 states, 6 states have (on average 316.5) internal successors, (1899), 6 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:00,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:00,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 376 [2024-11-10 14:31:00,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:01,191 INFO L124 PetriNetUnfolderBase]: 199/1957 cut-off events. [2024-11-10 14:31:01,191 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 14:31:01,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1957 events. 199/1957 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9080 event pairs, 54 based on Foata normal form. 0/1815 useless extension candidates. Maximal degree in co-relation 1930. Up to 448 conditions per place. [2024-11-10 14:31:01,200 INFO L140 encePairwiseOnDemand]: 364/376 looper letters, 71 selfloop transitions, 23 changer transitions 0/399 dead transitions. [2024-11-10 14:31:01,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 399 transitions, 1052 flow [2024-11-10 14:31:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:31:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:31:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1949 transitions. [2024-11-10 14:31:01,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8639184397163121 [2024-11-10 14:31:01,204 INFO L175 Difference]: Start difference. First operand has 370 places, 364 transitions, 786 flow. Second operand 6 states and 1949 transitions. [2024-11-10 14:31:01,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 399 transitions, 1052 flow [2024-11-10 14:31:01,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 399 transitions, 1046 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-10 14:31:01,210 INFO L231 Difference]: Finished difference. Result has 379 places, 386 transitions, 938 flow [2024-11-10 14:31:01,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=379, PETRI_TRANSITIONS=386} [2024-11-10 14:31:01,211 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 12 predicate places. [2024-11-10 14:31:01,212 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 386 transitions, 938 flow [2024-11-10 14:31:01,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.5) internal successors, (1899), 6 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:01,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:01,213 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:01,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:31:01,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 14:31:01,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:31:01,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash 194888816, now seen corresponding path program 1 times [2024-11-10 14:31:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:01,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750799430] [2024-11-10 14:31:01,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:01,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-10 14:31:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750799430] [2024-11-10 14:31:01,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750799430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:01,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285535106] [2024-11-10 14:31:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:01,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:01,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:01,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:31:01,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:31:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:02,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 14:31:02,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 2 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:02,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:31:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 2 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:31:02,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285535106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:31:02,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:31:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-11-10 14:31:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001662713] [2024-11-10 14:31:02,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:31:02,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 14:31:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 14:31:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-11-10 14:31:02,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 376 [2024-11-10 14:31:02,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 386 transitions, 938 flow. Second operand has 19 states, 19 states have (on average 349.6842105263158) internal successors, (6644), 19 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:02,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:02,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 376 [2024-11-10 14:31:02,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:04,324 INFO L124 PetriNetUnfolderBase]: 186/3516 cut-off events. [2024-11-10 14:31:04,325 INFO L125 PetriNetUnfolderBase]: For 235/239 co-relation queries the response was YES. [2024-11-10 14:31:04,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4240 conditions, 3516 events. 186/3516 cut-off events. For 235/239 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9756 event pairs, 55 based on Foata normal form. 13/3360 useless extension candidates. Maximal degree in co-relation 2893. Up to 146 conditions per place. [2024-11-10 14:31:04,339 INFO L140 encePairwiseOnDemand]: 365/376 looper letters, 47 selfloop transitions, 68 changer transitions 0/472 dead transitions. [2024-11-10 14:31:04,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 472 transitions, 1578 flow [2024-11-10 14:31:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-10 14:31:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2024-11-10 14:31:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 21989 transitions. [2024-11-10 14:31:04,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9282759202971969 [2024-11-10 14:31:04,366 INFO L175 Difference]: Start difference. First operand has 379 places, 386 transitions, 938 flow. Second operand 63 states and 21989 transitions. [2024-11-10 14:31:04,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 472 transitions, 1578 flow [2024-11-10 14:31:04,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 472 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:31:04,374 INFO L231 Difference]: Finished difference. Result has 457 places, 448 transitions, 1458 flow [2024-11-10 14:31:04,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1458, PETRI_PLACES=457, PETRI_TRANSITIONS=448} [2024-11-10 14:31:04,376 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 90 predicate places. [2024-11-10 14:31:04,376 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 448 transitions, 1458 flow [2024-11-10 14:31:04,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 349.6842105263158) internal successors, (6644), 19 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:04,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:04,378 INFO L204 CegarLoopForPetriNet]: trace histogram [16, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:04,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 14:31:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:04,580 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:31:04,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -277327377, now seen corresponding path program 2 times [2024-11-10 14:31:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020463008] [2024-11-10 14:31:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4516 proven. 1925 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2024-11-10 14:31:06,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:06,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020463008] [2024-11-10 14:31:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020463008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608467651] [2024-11-10 14:31:06,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:31:06,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:06,938 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:31:06,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 14:31:07,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 14:31:07,512 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:31:07,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 14:31:07,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:07,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-10 14:31:07,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-11-10 14:31:07,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:31:07,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-10 14:31:07,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:31:07,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-10 14:31:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8372 trivial. 0 not checked. [2024-11-10 14:31:07,661 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:31:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608467651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:07,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:31:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-11-10 14:31:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51561063] [2024-11-10 14:31:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:07,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:31:07,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:31:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-10 14:31:08,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 376 [2024-11-10 14:31:08,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 448 transitions, 1458 flow. Second operand has 6 states, 6 states have (on average 316.6666666666667) internal successors, (1900), 6 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:08,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:08,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 376 [2024-11-10 14:31:08,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:09,731 INFO L124 PetriNetUnfolderBase]: 311/4098 cut-off events. [2024-11-10 14:31:09,731 INFO L125 PetriNetUnfolderBase]: For 762/797 co-relation queries the response was YES. [2024-11-10 14:31:09,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5956 conditions, 4098 events. 311/4098 cut-off events. For 762/797 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 16193 event pairs, 61 based on Foata normal form. 8/3892 useless extension candidates. Maximal degree in co-relation 3890. Up to 1009 conditions per place. [2024-11-10 14:31:09,747 INFO L140 encePairwiseOnDemand]: 364/376 looper letters, 84 selfloop transitions, 31 changer transitions 0/487 dead transitions. [2024-11-10 14:31:09,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 487 transitions, 1808 flow [2024-11-10 14:31:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:31:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:31:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1945 transitions. [2024-11-10 14:31:09,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.862145390070922 [2024-11-10 14:31:09,749 INFO L175 Difference]: Start difference. First operand has 457 places, 448 transitions, 1458 flow. Second operand 6 states and 1945 transitions. [2024-11-10 14:31:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 487 transitions, 1808 flow [2024-11-10 14:31:09,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 487 transitions, 1732 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-11-10 14:31:09,759 INFO L231 Difference]: Finished difference. Result has 460 places, 478 transitions, 1640 flow [2024-11-10 14:31:09,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1640, PETRI_PLACES=460, PETRI_TRANSITIONS=478} [2024-11-10 14:31:09,760 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 93 predicate places. [2024-11-10 14:31:09,760 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 478 transitions, 1640 flow [2024-11-10 14:31:09,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.6666666666667) internal successors, (1900), 6 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:09,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:09,761 INFO L204 CegarLoopForPetriNet]: trace histogram [16, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:09,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:31:09,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:09,966 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:31:09,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1832259688, now seen corresponding path program 1 times [2024-11-10 14:31:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943811012] [2024-11-10 14:31:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4516 proven. 1925 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2024-11-10 14:31:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943811012] [2024-11-10 14:31:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943811012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981385683] [2024-11-10 14:31:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:12,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:12,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:31:12,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 14:31:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:13,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 5678 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 14:31:13,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4516 proven. 1925 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2024-11-10 14:31:14,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:31:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 4516 proven. 1925 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2024-11-10 14:31:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981385683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:31:14,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:31:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-10 14:31:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458216426] [2024-11-10 14:31:14,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:31:14,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 14:31:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 14:31:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 14:31:14,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 376 [2024-11-10 14:31:14,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 478 transitions, 1640 flow. Second operand has 34 states, 34 states have (on average 355.1764705882353) internal successors, (12076), 34 states have internal predecessors, (12076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:14,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:14,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 376 [2024-11-10 14:31:14,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:17,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L1037-3-->L1037: Formula: (and (= |v_fThread1of1ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_88| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_88|) (+ (* |v_fThread1of1ForFork0_~j~0#1_29| 24) |v_~#c~0.offset_88| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_88|, #pthreadsMutex=|v_#pthreadsMutex_12|, fThread1of1ForFork0_~j~0#1=|v_fThread1of1ForFork0_~j~0#1_29|, ~#c~0.offset=|v_~#c~0.offset_88|} OutVars{~#c~0.base=|v_~#c~0.base_88|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork0_~j~0#1=|v_fThread1of1ForFork0_~j~0#1_29|, ~#c~0.offset=|v_~#c~0.offset_88|, fThread1of1ForFork0_#t~ret18#1=|v_fThread1of1ForFork0_#t~ret18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork0_#t~ret18#1][414], [Black: 386#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 10110#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 10102#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), 370#true, 1835#true, Black: 10106#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 10114#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 3070#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 3082#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 396#(= |ULTIMATE.start_main_~j~1#1| 0), Black: 3078#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 3074#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 250#ULTIMATE.startFINALtrue, Black: 5694#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3092#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 5652#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 5662#(and (= 0 |ULTIMATE.start_main_#t~post22#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 368#true, Black: 4497#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 5682#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3090#(= |ULTIMATE.start_main_~i~0#1| 0), 428#true, Black: 4227#(<= |ULTIMATE.start_main_~j~1#1| 3), 10120#true, Black: 5688#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 5658#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 1236#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 4483#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 5700#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 432#(<= |ULTIMATE.start_main_~j~1#1| 1), Black: 5640#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 5646#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), 252#L1037true, Black: 4772#(< |ULTIMATE.start_main_~j~1#1| 28), 5741#true, 3088#true, 17#L1037true]) [2024-11-10 14:31:17,292 INFO L294 olderBase$Statistics]: this new event has 3005 ancestors and is cut-off event [2024-11-10 14:31:17,292 INFO L297 olderBase$Statistics]: existing Event has 2977 ancestors and is cut-off event [2024-11-10 14:31:17,292 INFO L297 olderBase$Statistics]: existing Event has 2977 ancestors and is cut-off event [2024-11-10 14:31:17,292 INFO L297 olderBase$Statistics]: existing Event has 2977 ancestors and is cut-off event [2024-11-10 14:31:18,521 INFO L124 PetriNetUnfolderBase]: 340/6598 cut-off events. [2024-11-10 14:31:18,521 INFO L125 PetriNetUnfolderBase]: For 4227/4245 co-relation queries the response was YES. [2024-11-10 14:31:18,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8496 conditions, 6598 events. 340/6598 cut-off events. For 4227/4245 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 18517 event pairs, 100 based on Foata normal form. 30/6360 useless extension candidates. Maximal degree in co-relation 5788. Up to 259 conditions per place. [2024-11-10 14:31:18,543 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 47 selfloop transitions, 135 changer transitions 0/579 dead transitions. [2024-11-10 14:31:18,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 579 transitions, 2768 flow [2024-11-10 14:31:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-10 14:31:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-10 14:31:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 15965 transitions. [2024-11-10 14:31:18,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435579196217494 [2024-11-10 14:31:18,614 INFO L175 Difference]: Start difference. First operand has 460 places, 478 transitions, 1640 flow. Second operand 45 states and 15965 transitions. [2024-11-10 14:31:18,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 579 transitions, 2768 flow [2024-11-10 14:31:18,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 579 transitions, 2768 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:31:18,633 INFO L231 Difference]: Finished difference. Result has 513 places, 553 transitions, 2514 flow [2024-11-10 14:31:18,634 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2514, PETRI_PLACES=513, PETRI_TRANSITIONS=553} [2024-11-10 14:31:18,635 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 146 predicate places. [2024-11-10 14:31:18,635 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 553 transitions, 2514 flow [2024-11-10 14:31:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 355.1764705882353) internal successors, (12076), 34 states have internal predecessors, (12076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:18,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:18,641 INFO L204 CegarLoopForPetriNet]: trace histogram [32, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:18,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 14:31:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-10 14:31:18,845 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:31:18,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1689374360, now seen corresponding path program 2 times [2024-11-10 14:31:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098766045] [2024-11-10 14:31:18,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:18,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 39740 backedges. 20564 proven. 9585 refuted. 0 times theorem prover too weak. 9591 trivial. 0 not checked. [2024-11-10 14:31:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098766045] [2024-11-10 14:31:27,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098766045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937995196] [2024-11-10 14:31:27,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:31:27,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:27,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:27,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:31:27,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 14:31:28,404 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 14:31:28,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:31:28,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 14:31:28,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:28,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 14:31:28,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 14:31:28,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:31:28,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-10 14:31:28,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:31:28,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-10 14:31:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 39740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39740 trivial. 0 not checked. [2024-11-10 14:31:28,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:31:28,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937995196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:31:28,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:31:28,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [33] total 37 [2024-11-10 14:31:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499017322] [2024-11-10 14:31:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:31:28,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:31:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:31:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 14:31:29,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 376 [2024-11-10 14:31:29,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 553 transitions, 2514 flow. Second operand has 6 states, 6 states have (on average 315.5) internal successors, (1893), 6 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:29,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:29,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 376 [2024-11-10 14:31:29,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:33,205 INFO L124 PetriNetUnfolderBase]: 457/6870 cut-off events. [2024-11-10 14:31:33,206 INFO L125 PetriNetUnfolderBase]: For 2511/2610 co-relation queries the response was YES. [2024-11-10 14:31:33,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10816 conditions, 6870 events. 457/6870 cut-off events. For 2511/2610 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 22100 event pairs, 87 based on Foata normal form. 34/6670 useless extension candidates. Maximal degree in co-relation 7332. Up to 1847 conditions per place. [2024-11-10 14:31:33,232 INFO L140 encePairwiseOnDemand]: 365/376 looper letters, 108 selfloop transitions, 55 changer transitions 0/614 dead transitions. [2024-11-10 14:31:33,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 614 transitions, 3166 flow [2024-11-10 14:31:33,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:31:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:31:33,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1942 transitions. [2024-11-10 14:31:33,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8608156028368794 [2024-11-10 14:31:33,237 INFO L175 Difference]: Start difference. First operand has 513 places, 553 transitions, 2514 flow. Second operand 6 states and 1942 transitions. [2024-11-10 14:31:33,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 614 transitions, 3166 flow [2024-11-10 14:31:33,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 614 transitions, 3058 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-11-10 14:31:33,259 INFO L231 Difference]: Finished difference. Result has 505 places, 602 transitions, 2960 flow [2024-11-10 14:31:33,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=2406, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2960, PETRI_PLACES=505, PETRI_TRANSITIONS=602} [2024-11-10 14:31:33,260 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 138 predicate places. [2024-11-10 14:31:33,261 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 602 transitions, 2960 flow [2024-11-10 14:31:33,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 315.5) internal successors, (1893), 6 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:33,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:31:33,262 INFO L204 CegarLoopForPetriNet]: trace histogram [32, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:31:33,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 14:31:33,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 14:31:33,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:31:33,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:31:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1052891647, now seen corresponding path program 1 times [2024-11-10 14:31:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:31:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166560369] [2024-11-10 14:31:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:31:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 39740 backedges. 20564 proven. 9585 refuted. 0 times theorem prover too weak. 9591 trivial. 0 not checked. [2024-11-10 14:31:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:31:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166560369] [2024-11-10 14:31:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166560369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:31:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953062869] [2024-11-10 14:31:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:31:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:31:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:31:41,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:31:41,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 14:31:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:31:43,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 11600 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 14:31:43,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:31:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 39740 backedges. 20564 proven. 9585 refuted. 0 times theorem prover too weak. 9591 trivial. 0 not checked. [2024-11-10 14:31:44,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:31:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 39740 backedges. 20564 proven. 9585 refuted. 0 times theorem prover too weak. 9591 trivial. 0 not checked. [2024-11-10 14:31:46,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953062869] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:31:46,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:31:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2024-11-10 14:31:46,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220743132] [2024-11-10 14:31:46,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:31:46,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-10 14:31:46,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:31:46,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-10 14:31:46,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2024-11-10 14:31:46,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 376 [2024-11-10 14:31:46,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 602 transitions, 2960 flow. Second operand has 63 states, 63 states have (on average 355.14285714285717) internal successors, (22374), 63 states have internal predecessors, (22374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:31:46,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:31:46,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 376 [2024-11-10 14:31:46,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:31:58,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([652] L1037-3-->L1037: Formula: (and (= |v_fThread1of1ForFork0_#t~ret18#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#c~0.base_88| (store (select |v_#pthreadsMutex_12| |v_~#c~0.base_88|) (+ (* |v_fThread1of1ForFork0_~j~0#1_29| 24) |v_~#c~0.offset_88| 80) 0)))) InVars {~#c~0.base=|v_~#c~0.base_88|, #pthreadsMutex=|v_#pthreadsMutex_12|, fThread1of1ForFork0_~j~0#1=|v_fThread1of1ForFork0_~j~0#1_29|, ~#c~0.offset=|v_~#c~0.offset_88|} OutVars{~#c~0.base=|v_~#c~0.base_88|, #pthreadsMutex=|v_#pthreadsMutex_11|, fThread1of1ForFork0_~j~0#1=|v_fThread1of1ForFork0_~j~0#1_29|, ~#c~0.offset=|v_~#c~0.offset_88|, fThread1of1ForFork0_#t~ret18#1=|v_fThread1of1ForFork0_#t~ret18#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, fThread1of1ForFork0_#t~ret18#1][533], [18955#true, Black: 16941#(< |ULTIMATE.start_main_~j~1#1| 28), Black: 16652#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 10110#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 386#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 10102#(= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0), Black: 17766#(< |ULTIMATE.start_main_~j~1#1| 25), Black: 10106#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 10114#(and (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 2 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) 3 |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |fThread1of1ForFork0_~j~0#1| 8) |~#c~0.offset| 1)) 0)), Black: 16666#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 18041#(< |ULTIMATE.start_main_~j~1#1| 24), Black: 17216#(< |ULTIMATE.start_main_~j~1#1| 27), Black: 10136#(<= |ULTIMATE.start_main_~j~1#1| 7), Black: 17491#(< |ULTIMATE.start_main_~j~1#1| 26), Black: 3070#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 3082#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= 0 (select (select |#race| |~#c~0.base|) (+ 3 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))))), Black: 396#(= |ULTIMATE.start_main_~j~1#1| 0), Black: 3078#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), Black: 3074#(and (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|) 1)) 0) (= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0)), 428#true, 10120#true, Black: 1236#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 432#(<= |ULTIMATE.start_main_~j~1#1| 1), 27733#true, 3088#true, 1835#true, 370#true, Black: 27715#(= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0), Black: 27727#(and (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 2)) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 3)) 0)), Black: 27719#(and (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 1)) 0)), Black: 27723#(and (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) |fThread1of1ForFork1_~pos~0#1.offset|) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 1)) 0) (= (select (select |#race| |fThread1of1ForFork1_~pos~0#1.base|) (+ |fThread1of1ForFork1_~pos~0#1.offset| 2)) 0)), 250#ULTIMATE.startFINALtrue, Black: 5694#(and (<= |ULTIMATE.start_main_~j~1#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3092#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 5652#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 28)), Black: 5662#(and (= 0 |ULTIMATE.start_main_#t~post22#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 368#true, Black: 4497#(< |ULTIMATE.start_main_~j~1#1| 29), Black: 5682#(and (<= |ULTIMATE.start_main_~j~1#1| 3) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 3090#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 4227#(<= |ULTIMATE.start_main_~j~1#1| 3), Black: 5688#(and (<= |ULTIMATE.start_main_~j~1#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 5658#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 29)), Black: 4483#(< |ULTIMATE.start_main_~j~1#1| 30), Black: 5700#(and (<= |ULTIMATE.start_main_~j~1#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 5640#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 3)), Black: 5646#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~1#1| 27)), 252#L1037true, Black: 4772#(< |ULTIMATE.start_main_~j~1#1| 28), 5741#true, 17#L1037true]) [2024-11-10 14:31:58,004 INFO L294 olderBase$Statistics]: this new event has 5735 ancestors and is cut-off event [2024-11-10 14:31:58,005 INFO L297 olderBase$Statistics]: existing Event has 5707 ancestors and is cut-off event [2024-11-10 14:31:58,005 INFO L297 olderBase$Statistics]: existing Event has 5707 ancestors and is cut-off event [2024-11-10 14:31:58,005 INFO L297 olderBase$Statistics]: existing Event has 5707 ancestors and is cut-off event [2024-11-10 14:32:02,007 INFO L124 PetriNetUnfolderBase]: 526/11445 cut-off events. [2024-11-10 14:32:02,007 INFO L125 PetriNetUnfolderBase]: For 17243/17345 co-relation queries the response was YES. [2024-11-10 14:32:02,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15692 conditions, 11445 events. 526/11445 cut-off events. For 17243/17345 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 25445 event pairs, 115 based on Foata normal form. 81/11195 useless extension candidates. Maximal degree in co-relation 12327. Up to 318 conditions per place. [2024-11-10 14:32:02,046 INFO L140 encePairwiseOnDemand]: 370/376 looper letters, 92 selfloop transitions, 270 changer transitions 0/808 dead transitions. [2024-11-10 14:32:02,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 808 transitions, 5870 flow [2024-11-10 14:32:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-10 14:32:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2024-11-10 14:32:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 31917 transitions. [2024-11-10 14:32:02,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9431737588652482 [2024-11-10 14:32:02,060 INFO L175 Difference]: Start difference. First operand has 505 places, 602 transitions, 2960 flow. Second operand 90 states and 31917 transitions. [2024-11-10 14:32:02,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 808 transitions, 5870 flow [2024-11-10 14:32:02,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 808 transitions, 5870 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:32:02,086 INFO L231 Difference]: Finished difference. Result has 610 places, 740 transitions, 4952 flow [2024-11-10 14:32:02,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=2960, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4952, PETRI_PLACES=610, PETRI_TRANSITIONS=740} [2024-11-10 14:32:02,087 INFO L277 CegarLoopForPetriNet]: 367 programPoint places, 243 predicate places. [2024-11-10 14:32:02,087 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 740 transitions, 4952 flow [2024-11-10 14:32:02,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 355.14285714285717) internal successors, (22374), 63 states have internal predecessors, (22374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:32:02,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:32:02,093 INFO L204 CegarLoopForPetriNet]: trace histogram [62, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:32:02,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 14:32:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:32:02,295 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-10 14:32:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:32:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2023310625, now seen corresponding path program 2 times [2024-11-10 14:32:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:32:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821787870] [2024-11-10 14:32:02,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:32:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:32:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat