./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8ffb6ed4cf93a465c15dff37fbdc82f2f1bfe68c16d8d908373acd9cd0f46e43 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:08:14,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:08:14,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:08:14,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:08:14,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:08:14,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:08:14,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:08:14,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:08:14,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:08:14,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:08:14,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:08:14,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:08:14,777 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:08:14,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:08:14,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:08:14,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:08:14,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:08:14,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:08:14,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:08:14,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:08:14,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:08:14,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:08:14,786 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:08:14,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:08:14,786 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:08:14,786 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:08:14,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:08:14,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:08:14,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:08:14,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:08:14,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:08:14,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:08:14,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:08:14,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:08:14,788 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:08:14,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:08:14,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:08:14,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:08:14,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:08:14,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:08:14,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:08:14,791 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-clean/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-clean/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 -> 8ffb6ed4cf93a465c15dff37fbdc82f2f1bfe68c16d8d908373acd9cd0f46e43 [2024-10-11 17:08:15,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:08:15,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:08:15,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:08:15,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:08:15,085 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:08:15,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i [2024-10-11 17:08:16,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:08:16,796 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:08:16,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_20-arrayloop2_rc.i [2024-10-11 17:08:16,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2e4db1c90/2068a0a8d7ec416686a9c53fe441f7e3/FLAGba9fb50cd [2024-10-11 17:08:16,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2e4db1c90/2068a0a8d7ec416686a9c53fe441f7e3 [2024-10-11 17:08:16,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:08:16,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:08:16,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:08:16,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:08:16,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:08:16,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:08:16" (1/1) ... [2024-10-11 17:08:16,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12113adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:16, skipping insertion in model container [2024-10-11 17:08:16,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:08:16" (1/1) ... [2024-10-11 17:08:16,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:08:17,335 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,336 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,337 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,338 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:08:17,399 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:08:17,434 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,435 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,435 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,436 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-11 17:08:17,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:08:17,509 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:08:17,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17 WrapperNode [2024-10-11 17:08:17,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:08:17,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:08:17,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:08:17,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:08:17,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,573 INFO L138 Inliner]: procedures = 272, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 269 [2024-10-11 17:08:17,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:08:17,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:08:17,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:08:17,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:08:17,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:08:17,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:08:17,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:08:17,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:08:17,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (1/1) ... [2024-10-11 17:08:17,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:08:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:08:17,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:08:17,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:08:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 17:08:17,732 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 17:08:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure g [2024-10-11 17:08:17,734 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-11 17:08:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:08:17,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:08:17,736 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:08:17,937 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:08:17,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:08:18,546 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:08:18,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:08:18,595 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:08:18,596 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:08:18,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:08:18 BoogieIcfgContainer [2024-10-11 17:08:18,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:08:18,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:08:18,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:08:18,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:08:18,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:08:16" (1/3) ... [2024-10-11 17:08:18,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cac7c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:08:18, skipping insertion in model container [2024-10-11 17:08:18,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:08:17" (2/3) ... [2024-10-11 17:08:18,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cac7c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:08:18, skipping insertion in model container [2024-10-11 17:08:18,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:08:18" (3/3) ... [2024-10-11 17:08:18,609 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_20-arrayloop2_rc.i [2024-10-11 17:08:18,628 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:08:18,628 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-10-11 17:08:18,628 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:08:18,754 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 17:08:18,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 302 transitions, 612 flow [2024-10-11 17:08:18,922 INFO L124 PetriNetUnfolderBase]: 14/300 cut-off events. [2024-10-11 17:08:18,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:08:18,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 300 events. 14/300 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 586 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2024-10-11 17:08:18,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 302 transitions, 612 flow [2024-10-11 17:08:18,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 293 places, 300 transitions, 606 flow [2024-10-11 17:08:18,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:08:18,968 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;@1e417d74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:08:18,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-11 17:08:18,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:08:18,979 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-10-11 17:08:18,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:08:18,979 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:18,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:08:18,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:18,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1289732138, now seen corresponding path program 1 times [2024-10-11 17:08:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:18,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667039201] [2024-10-11 17:08:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:19,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:19,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667039201] [2024-10-11 17:08:19,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667039201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:19,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:19,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450644738] [2024-10-11 17:08:19,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:19,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:19,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:20,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 302 [2024-10-11 17:08:20,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 300 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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-10-11 17:08:20,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:20,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 302 [2024-10-11 17:08:20,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:20,971 INFO L124 PetriNetUnfolderBase]: 449/1773 cut-off events. [2024-10-11 17:08:20,972 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 17:08:20,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1773 events. 449/1773 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11658 event pairs, 342 based on Foata normal form. 152/1718 useless extension candidates. Maximal degree in co-relation 2477. Up to 846 conditions per place. [2024-10-11 17:08:20,994 INFO L140 encePairwiseOnDemand]: 282/302 looper letters, 72 selfloop transitions, 10 changer transitions 0/290 dead transitions. [2024-10-11 17:08:20,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 290 transitions, 750 flow [2024-10-11 17:08:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1352 transitions. [2024-10-11 17:08:21,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7461368653421634 [2024-10-11 17:08:21,023 INFO L175 Difference]: Start difference. First operand has 293 places, 300 transitions, 606 flow. Second operand 6 states and 1352 transitions. [2024-10-11 17:08:21,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 290 transitions, 750 flow [2024-10-11 17:08:21,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 290 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:08:21,040 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 604 flow [2024-10-11 17:08:21,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2024-10-11 17:08:21,050 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 1 predicate places. [2024-10-11 17:08:21,050 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 604 flow [2024-10-11 17:08:21,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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-10-11 17:08:21,052 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:21,052 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] [2024-10-11 17:08:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:08:21,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:21,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2025788305, now seen corresponding path program 1 times [2024-10-11 17:08:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324816533] [2024-10-11 17:08:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:21,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324816533] [2024-10-11 17:08:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324816533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710757743] [2024-10-11 17:08:21,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:21,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:21,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:21,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 302 [2024-10-11 17:08:21,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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-10-11 17:08:21,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:21,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 302 [2024-10-11 17:08:21,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:22,238 INFO L124 PetriNetUnfolderBase]: 449/1771 cut-off events. [2024-10-11 17:08:22,239 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:08:22,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1771 events. 449/1771 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11610 event pairs, 342 based on Foata normal form. 0/1566 useless extension candidates. Maximal degree in co-relation 2505. Up to 846 conditions per place. [2024-10-11 17:08:22,250 INFO L140 encePairwiseOnDemand]: 290/302 looper letters, 72 selfloop transitions, 10 changer transitions 0/288 dead transitions. [2024-10-11 17:08:22,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 288 transitions, 764 flow [2024-10-11 17:08:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1344 transitions. [2024-10-11 17:08:22,254 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7417218543046358 [2024-10-11 17:08:22,254 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 604 flow. Second operand 6 states and 1344 transitions. [2024-10-11 17:08:22,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 288 transitions, 764 flow [2024-10-11 17:08:22,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 288 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:22,260 INFO L231 Difference]: Finished difference. Result has 292 places, 288 transitions, 600 flow [2024-10-11 17:08:22,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=292, PETRI_TRANSITIONS=288} [2024-10-11 17:08:22,263 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, -1 predicate places. [2024-10-11 17:08:22,263 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 288 transitions, 600 flow [2024-10-11 17:08:22,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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-10-11 17:08:22,265 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:22,265 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] [2024-10-11 17:08:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:08:22,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2126081574, now seen corresponding path program 1 times [2024-10-11 17:08:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:22,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912598020] [2024-10-11 17:08:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:22,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912598020] [2024-10-11 17:08:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912598020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:22,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:22,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:08:22,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027119546] [2024-10-11 17:08:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:08:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:22,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:08:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:08:22,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 302 [2024-10-11 17:08:22,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 288 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-10-11 17:08:22,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:22,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 302 [2024-10-11 17:08:22,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:22,422 INFO L124 PetriNetUnfolderBase]: 29/590 cut-off events. [2024-10-11 17:08:22,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:08:22,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 590 events. 29/590 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2413 event pairs, 18 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 433. Up to 45 conditions per place. [2024-10-11 17:08:22,426 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-10-11 17:08:22,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 628 flow [2024-10-11 17:08:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:08:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:08:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-10-11 17:08:22,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9492273730684326 [2024-10-11 17:08:22,429 INFO L175 Difference]: Start difference. First operand has 292 places, 288 transitions, 600 flow. Second operand 3 states and 860 transitions. [2024-10-11 17:08:22,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 628 flow [2024-10-11 17:08:22,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:22,437 INFO L231 Difference]: Finished difference. Result has 290 places, 289 transitions, 592 flow [2024-10-11 17:08:22,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=290, PETRI_TRANSITIONS=289} [2024-10-11 17:08:22,438 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, -3 predicate places. [2024-10-11 17:08:22,442 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 289 transitions, 592 flow [2024-10-11 17:08:22,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-10-11 17:08:22,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:22,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:08:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:08:22,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:22,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1000411678, now seen corresponding path program 1 times [2024-10-11 17:08:22,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:22,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773167086] [2024-10-11 17:08:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:22,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773167086] [2024-10-11 17:08:22,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773167086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:22,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257138999] [2024-10-11 17:08:22,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:22,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:23,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 302 [2024-10-11 17:08:23,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 289 transitions, 592 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 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-10-11 17:08:23,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:23,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 302 [2024-10-11 17:08:23,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:23,551 INFO L124 PetriNetUnfolderBase]: 450/1893 cut-off events. [2024-10-11 17:08:23,552 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:08:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1893 events. 450/1893 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 12343 event pairs, 342 based on Foata normal form. 0/1684 useless extension candidates. Maximal degree in co-relation 2658. Up to 894 conditions per place. [2024-10-11 17:08:23,566 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 79 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2024-10-11 17:08:23,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 758 flow [2024-10-11 17:08:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1339 transitions. [2024-10-11 17:08:23,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7389624724061811 [2024-10-11 17:08:23,570 INFO L175 Difference]: Start difference. First operand has 290 places, 289 transitions, 592 flow. Second operand 6 states and 1339 transitions. [2024-10-11 17:08:23,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 758 flow [2024-10-11 17:08:23,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 288 transitions, 756 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:08:23,575 INFO L231 Difference]: Finished difference. Result has 293 places, 288 transitions, 598 flow [2024-10-11 17:08:23,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=293, PETRI_TRANSITIONS=288} [2024-10-11 17:08:23,578 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 0 predicate places. [2024-10-11 17:08:23,578 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 288 transitions, 598 flow [2024-10-11 17:08:23,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 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-10-11 17:08:23,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:23,579 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] [2024-10-11 17:08:23,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:08:23,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:23,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1368928512, now seen corresponding path program 1 times [2024-10-11 17:08:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:23,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419936692] [2024-10-11 17:08:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419936692] [2024-10-11 17:08:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419936692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:08:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960210396] [2024-10-11 17:08:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:08:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:08:23,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:08:23,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 302 [2024-10-11 17:08:23,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 288 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-10-11 17:08:23,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:23,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 302 [2024-10-11 17:08:23,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:23,775 INFO L124 PetriNetUnfolderBase]: 29/776 cut-off events. [2024-10-11 17:08:23,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:08:23,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 776 events. 29/776 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2394 event pairs, 18 based on Foata normal form. 2/720 useless extension candidates. Maximal degree in co-relation 511. Up to 49 conditions per place. [2024-10-11 17:08:23,779 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-10-11 17:08:23,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 626 flow [2024-10-11 17:08:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:08:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:08:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-10-11 17:08:23,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9492273730684326 [2024-10-11 17:08:23,782 INFO L175 Difference]: Start difference. First operand has 293 places, 288 transitions, 598 flow. Second operand 3 states and 860 transitions. [2024-10-11 17:08:23,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 626 flow [2024-10-11 17:08:23,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 616 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:23,787 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 600 flow [2024-10-11 17:08:23,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2024-10-11 17:08:23,788 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, -2 predicate places. [2024-10-11 17:08:23,788 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 600 flow [2024-10-11 17:08:23,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 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-10-11 17:08:23,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:23,789 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] [2024-10-11 17:08:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:08:23,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1780007149, now seen corresponding path program 1 times [2024-10-11 17:08:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096049697] [2024-10-11 17:08:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:24,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096049697] [2024-10-11 17:08:24,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096049697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:24,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:24,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:24,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413099931] [2024-10-11 17:08:24,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:24,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:24,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:24,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:24,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:24,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 302 [2024-10-11 17:08:24,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 238.5) internal successors, (1431), 6 states have internal predecessors, (1431), 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-10-11 17:08:24,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:24,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 302 [2024-10-11 17:08:24,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:24,894 INFO L124 PetriNetUnfolderBase]: 75/1088 cut-off events. [2024-10-11 17:08:24,894 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:08:24,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1405 conditions, 1088 events. 75/1088 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4554 event pairs, 42 based on Foata normal form. 0/995 useless extension candidates. Maximal degree in co-relation 951. Up to 263 conditions per place. [2024-10-11 17:08:24,901 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 54 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2024-10-11 17:08:24,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 288 transitions, 716 flow [2024-10-11 17:08:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:24,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1464 transitions. [2024-10-11 17:08:24,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8079470198675497 [2024-10-11 17:08:24,904 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 600 flow. Second operand 6 states and 1464 transitions. [2024-10-11 17:08:24,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 288 transitions, 716 flow [2024-10-11 17:08:24,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:08:24,913 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 606 flow [2024-10-11 17:08:24,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=606, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2024-10-11 17:08:24,914 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 1 predicate places. [2024-10-11 17:08:24,914 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 606 flow [2024-10-11 17:08:24,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.5) internal successors, (1431), 6 states have internal predecessors, (1431), 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-10-11 17:08:24,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:24,918 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] [2024-10-11 17:08:24,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:08:24,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:24,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 556912444, now seen corresponding path program 1 times [2024-10-11 17:08:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097487736] [2024-10-11 17:08:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097487736] [2024-10-11 17:08:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097487736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16301336] [2024-10-11 17:08:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:25,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 302 [2024-10-11 17:08:25,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 606 flow. Second operand has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 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-10-11 17:08:25,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:25,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 302 [2024-10-11 17:08:25,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:26,189 INFO L124 PetriNetUnfolderBase]: 450/2073 cut-off events. [2024-10-11 17:08:26,189 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:08:26,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3129 conditions, 2073 events. 450/2073 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12300 event pairs, 342 based on Foata normal form. 0/1864 useless extension candidates. Maximal degree in co-relation 2701. Up to 960 conditions per place. [2024-10-11 17:08:26,205 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 79 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2024-10-11 17:08:26,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 772 flow [2024-10-11 17:08:26,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1339 transitions. [2024-10-11 17:08:26,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7389624724061811 [2024-10-11 17:08:26,209 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 606 flow. Second operand 6 states and 1339 transitions. [2024-10-11 17:08:26,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 772 flow [2024-10-11 17:08:26,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 762 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:26,214 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 604 flow [2024-10-11 17:08:26,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2024-10-11 17:08:26,216 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 0 predicate places. [2024-10-11 17:08:26,216 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 604 flow [2024-10-11 17:08:26,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.33333333333334) internal successors, (1286), 6 states have internal predecessors, (1286), 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-10-11 17:08:26,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:26,217 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] [2024-10-11 17:08:26,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:08:26,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:26,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1290038916, now seen corresponding path program 1 times [2024-10-11 17:08:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:26,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366619420] [2024-10-11 17:08:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366619420] [2024-10-11 17:08:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366619420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:26,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:26,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104151961] [2024-10-11 17:08:26,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:26,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:26,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:26,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:27,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 302 [2024-10-11 17:08:27,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 604 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-10-11 17:08:27,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:27,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 302 [2024-10-11 17:08:27,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:27,403 INFO L124 PetriNetUnfolderBase]: 450/2069 cut-off events. [2024-10-11 17:08:27,404 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:08:27,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 2069 events. 450/2069 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12318 event pairs, 342 based on Foata normal form. 0/1864 useless extension candidates. Maximal degree in co-relation 2717. Up to 944 conditions per place. [2024-10-11 17:08:27,419 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 75 selfloop transitions, 5 changer transitions 0/286 dead transitions. [2024-10-11 17:08:27,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 286 transitions, 762 flow [2024-10-11 17:08:27,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1359 transitions. [2024-10-11 17:08:27,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-11 17:08:27,423 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 604 flow. Second operand 6 states and 1359 transitions. [2024-10-11 17:08:27,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 286 transitions, 762 flow [2024-10-11 17:08:27,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 286 transitions, 752 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:27,430 INFO L231 Difference]: Finished difference. Result has 292 places, 286 transitions, 602 flow [2024-10-11 17:08:27,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=602, PETRI_PLACES=292, PETRI_TRANSITIONS=286} [2024-10-11 17:08:27,433 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, -1 predicate places. [2024-10-11 17:08:27,433 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 286 transitions, 602 flow [2024-10-11 17:08:27,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-10-11 17:08:27,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:27,434 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] [2024-10-11 17:08:27,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:08:27,436 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1151030931, now seen corresponding path program 1 times [2024-10-11 17:08:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:27,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950550130] [2024-10-11 17:08:27,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:27,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:27,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950550130] [2024-10-11 17:08:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950550130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:27,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:27,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838580876] [2024-10-11 17:08:27,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:27,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:27,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:28,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 302 [2024-10-11 17:08:28,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 286 transitions, 602 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-10-11 17:08:28,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:28,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 302 [2024-10-11 17:08:28,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:28,633 INFO L124 PetriNetUnfolderBase]: 450/2065 cut-off events. [2024-10-11 17:08:28,633 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:08:28,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3105 conditions, 2065 events. 450/2065 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12308 event pairs, 342 based on Foata normal form. 0/1864 useless extension candidates. Maximal degree in co-relation 2732. Up to 944 conditions per place. [2024-10-11 17:08:28,652 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 75 selfloop transitions, 5 changer transitions 0/285 dead transitions. [2024-10-11 17:08:28,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 285 transitions, 760 flow [2024-10-11 17:08:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1359 transitions. [2024-10-11 17:08:28,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-10-11 17:08:28,655 INFO L175 Difference]: Start difference. First operand has 292 places, 286 transitions, 602 flow. Second operand 6 states and 1359 transitions. [2024-10-11 17:08:28,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 285 transitions, 760 flow [2024-10-11 17:08:28,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 285 transitions, 750 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:28,661 INFO L231 Difference]: Finished difference. Result has 291 places, 285 transitions, 600 flow [2024-10-11 17:08:28,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=291, PETRI_TRANSITIONS=285} [2024-10-11 17:08:28,662 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, -2 predicate places. [2024-10-11 17:08:28,663 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 285 transitions, 600 flow [2024-10-11 17:08:28,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-10-11 17:08:28,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:28,664 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] [2024-10-11 17:08:28,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:08:28,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:28,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash 844710235, now seen corresponding path program 1 times [2024-10-11 17:08:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016955349] [2024-10-11 17:08:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016955349] [2024-10-11 17:08:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016955349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:08:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:08:29,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328054954] [2024-10-11 17:08:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:29,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:08:29,449 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 302 [2024-10-11 17:08:29,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 285 transitions, 600 flow. Second operand has 6 states, 6 states have (on average 215.5) internal successors, (1293), 6 states have internal predecessors, (1293), 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-10-11 17:08:29,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:29,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 302 [2024-10-11 17:08:29,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:29,746 INFO L124 PetriNetUnfolderBase]: 450/2061 cut-off events. [2024-10-11 17:08:29,747 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:08:29,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 2061 events. 450/2061 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 12232 event pairs, 342 based on Foata normal form. 0/1864 useless extension candidates. Maximal degree in co-relation 2745. Up to 964 conditions per place. [2024-10-11 17:08:29,761 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 80 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2024-10-11 17:08:29,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 284 transitions, 768 flow [2024-10-11 17:08:29,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1334 transitions. [2024-10-11 17:08:29,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7362030905077263 [2024-10-11 17:08:29,765 INFO L175 Difference]: Start difference. First operand has 291 places, 285 transitions, 600 flow. Second operand 6 states and 1334 transitions. [2024-10-11 17:08:29,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 284 transitions, 768 flow [2024-10-11 17:08:29,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 284 transitions, 758 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:29,772 INFO L231 Difference]: Finished difference. Result has 290 places, 284 transitions, 598 flow [2024-10-11 17:08:29,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=598, PETRI_PLACES=290, PETRI_TRANSITIONS=284} [2024-10-11 17:08:29,773 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, -3 predicate places. [2024-10-11 17:08:29,774 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 284 transitions, 598 flow [2024-10-11 17:08:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.5) internal successors, (1293), 6 states have internal predecessors, (1293), 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-10-11 17:08:29,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:29,775 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] [2024-10-11 17:08:29,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:08:29,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:29,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:29,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1184018761, now seen corresponding path program 1 times [2024-10-11 17:08:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446445694] [2024-10-11 17:08:29,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446445694] [2024-10-11 17:08:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446445694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:08:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776022038] [2024-10-11 17:08:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:30,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:30,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:08:30,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:08:30,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:08:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:30,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:08:30,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:08:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:30,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:08:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776022038] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:08:30,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:08:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:08:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720254067] [2024-10-11 17:08:30,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:08:30,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:08:30,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:30,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:08:30,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:08:30,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 302 [2024-10-11 17:08:30,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 284 transitions, 598 flow. Second operand has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 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-10-11 17:08:30,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:30,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 302 [2024-10-11 17:08:30,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:30,800 INFO L124 PetriNetUnfolderBase]: 29/940 cut-off events. [2024-10-11 17:08:30,801 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:08:30,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 940 events. 29/940 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1796 event pairs, 18 based on Foata normal form. 4/906 useless extension candidates. Maximal degree in co-relation 504. Up to 49 conditions per place. [2024-10-11 17:08:30,806 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 15 selfloop transitions, 9 changer transitions 0/292 dead transitions. [2024-10-11 17:08:30,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 292 transitions, 664 flow [2024-10-11 17:08:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:08:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:08:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2537 transitions. [2024-10-11 17:08:30,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9334069168506255 [2024-10-11 17:08:30,811 INFO L175 Difference]: Start difference. First operand has 290 places, 284 transitions, 598 flow. Second operand 9 states and 2537 transitions. [2024-10-11 17:08:30,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 292 transitions, 664 flow [2024-10-11 17:08:30,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 292 transitions, 654 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:08:30,816 INFO L231 Difference]: Finished difference. Result has 296 places, 290 transitions, 638 flow [2024-10-11 17:08:30,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=638, PETRI_PLACES=296, PETRI_TRANSITIONS=290} [2024-10-11 17:08:30,817 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 3 predicate places. [2024-10-11 17:08:30,817 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 290 transitions, 638 flow [2024-10-11 17:08:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 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-10-11 17:08:30,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:30,819 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:08:30,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:08:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 17:08:31,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:31,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2048900635, now seen corresponding path program 2 times [2024-10-11 17:08:31,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:31,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029235116] [2024-10-11 17:08:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-11 17:08:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029235116] [2024-10-11 17:08:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029235116] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:08:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894277685] [2024-10-11 17:08:31,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:08:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:08:31,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:08:31,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:08:31,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:08:31,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:08:31,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:08:31,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:08:31,765 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-10-11 17:08:31,779 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-10-11 17:08:31,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:08:31,807 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-10-11 17:08:31,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:08:31,840 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-10-11 17:08:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-11 17:08:31,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:08:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894277685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:08:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 17:08:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578542623] [2024-10-11 17:08:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:31,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:31,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:08:32,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 302 [2024-10-11 17:08:32,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 290 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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-10-11 17:08:32,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:32,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 302 [2024-10-11 17:08:32,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:32,968 INFO L124 PetriNetUnfolderBase]: 199/1841 cut-off events. [2024-10-11 17:08:32,968 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:08:32,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 1841 events. 199/1841 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8823 event pairs, 54 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 1889. Up to 448 conditions per place. [2024-10-11 17:08:32,982 INFO L140 encePairwiseOnDemand]: 290/302 looper letters, 71 selfloop transitions, 23 changer transitions 0/325 dead transitions. [2024-10-11 17:08:32,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 325 transitions, 904 flow [2024-10-11 17:08:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1505 transitions. [2024-10-11 17:08:32,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8305739514348786 [2024-10-11 17:08:32,988 INFO L175 Difference]: Start difference. First operand has 296 places, 290 transitions, 638 flow. Second operand 6 states and 1505 transitions. [2024-10-11 17:08:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 325 transitions, 904 flow [2024-10-11 17:08:32,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 325 transitions, 898 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 17:08:32,994 INFO L231 Difference]: Finished difference. Result has 305 places, 312 transitions, 790 flow [2024-10-11 17:08:32,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=305, PETRI_TRANSITIONS=312} [2024-10-11 17:08:32,996 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 12 predicate places. [2024-10-11 17:08:32,996 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 312 transitions, 790 flow [2024-10-11 17:08:32,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 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-10-11 17:08:32,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:32,998 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:08:33,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:08:33,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:33,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting gErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash -820747997, now seen corresponding path program 1 times [2024-10-11 17:08:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014788239] [2024-10-11 17:08:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-10-11 17:08:33,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:33,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014788239] [2024-10-11 17:08:33,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014788239] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:08:33,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827815577] [2024-10-11 17:08:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:08:33,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:08:33,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:08:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:34,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 17:08:34,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:08:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 1 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:34,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:08:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 1 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:08:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827815577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:08:34,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:08:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-10-11 17:08:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625084761] [2024-10-11 17:08:34,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:08:34,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:08:34,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:08:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:08:34,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 302 [2024-10-11 17:08:34,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 312 transitions, 790 flow. Second operand has 19 states, 19 states have (on average 275.6842105263158) internal successors, (5238), 19 states have internal predecessors, (5238), 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-10-11 17:08:34,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:34,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 302 [2024-10-11 17:08:34,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:37,180 INFO L124 PetriNetUnfolderBase]: 186/3379 cut-off events. [2024-10-11 17:08:37,180 INFO L125 PetriNetUnfolderBase]: For 134/138 co-relation queries the response was YES. [2024-10-11 17:08:37,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 3379 events. 186/3379 cut-off events. For 134/138 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9518 event pairs, 55 based on Foata normal form. 13/3223 useless extension candidates. Maximal degree in co-relation 2787. Up to 146 conditions per place. [2024-10-11 17:08:37,192 INFO L140 encePairwiseOnDemand]: 291/302 looper letters, 47 selfloop transitions, 68 changer transitions 0/398 dead transitions. [2024-10-11 17:08:37,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 398 transitions, 1430 flow [2024-10-11 17:08:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-11 17:08:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2024-10-11 17:08:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 17327 transitions. [2024-10-11 17:08:37,222 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9107011458004836 [2024-10-11 17:08:37,222 INFO L175 Difference]: Start difference. First operand has 305 places, 312 transitions, 790 flow. Second operand 63 states and 17327 transitions. [2024-10-11 17:08:37,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 398 transitions, 1430 flow [2024-10-11 17:08:37,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 398 transitions, 1430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:08:37,233 INFO L231 Difference]: Finished difference. Result has 383 places, 374 transitions, 1310 flow [2024-10-11 17:08:37,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1310, PETRI_PLACES=383, PETRI_TRANSITIONS=374} [2024-10-11 17:08:37,234 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 90 predicate places. [2024-10-11 17:08:37,234 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 374 transitions, 1310 flow [2024-10-11 17:08:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 275.6842105263158) internal successors, (5238), 19 states have internal predecessors, (5238), 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-10-11 17:08:37,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:37,237 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 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] [2024-10-11 17:08:37,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:08:37,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:37,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting gErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 634224120, now seen corresponding path program 2 times [2024-10-11 17:08:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890973112] [2024-10-11 17:08:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 4450 proven. 1897 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2024-10-11 17:08:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:40,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890973112] [2024-10-11 17:08:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890973112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:08:40,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172638323] [2024-10-11 17:08:40,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:08:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:08:40,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:08:40,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:08:41,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:08:41,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:08:41,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 17:08:41,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:08:41,695 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-10-11 17:08:41,715 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-10-11 17:08:41,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:08:41,745 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-10-11 17:08:41,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:08:41,783 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-10-11 17:08:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8249 trivial. 0 not checked. [2024-10-11 17:08:41,818 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:08:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172638323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:08:41,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:08:41,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-10-11 17:08:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671619522] [2024-10-11 17:08:41,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:08:41,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:08:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:41,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:08:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:08:42,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 302 [2024-10-11 17:08:42,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 374 transitions, 1310 flow. Second operand has 6 states, 6 states have (on average 242.66666666666666) internal successors, (1456), 6 states have internal predecessors, (1456), 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-10-11 17:08:42,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:42,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 302 [2024-10-11 17:08:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:44,188 INFO L124 PetriNetUnfolderBase]: 311/3935 cut-off events. [2024-10-11 17:08:44,188 INFO L125 PetriNetUnfolderBase]: For 696/730 co-relation queries the response was YES. [2024-10-11 17:08:44,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 3935 events. 311/3935 cut-off events. For 696/730 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15612 event pairs, 61 based on Foata normal form. 8/3729 useless extension candidates. Maximal degree in co-relation 3813. Up to 1009 conditions per place. [2024-10-11 17:08:44,212 INFO L140 encePairwiseOnDemand]: 290/302 looper letters, 84 selfloop transitions, 31 changer transitions 0/413 dead transitions. [2024-10-11 17:08:44,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 413 transitions, 1660 flow [2024-10-11 17:08:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:08:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:08:44,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1501 transitions. [2024-10-11 17:08:44,216 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8283664459161147 [2024-10-11 17:08:44,216 INFO L175 Difference]: Start difference. First operand has 383 places, 374 transitions, 1310 flow. Second operand 6 states and 1501 transitions. [2024-10-11 17:08:44,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 413 transitions, 1660 flow [2024-10-11 17:08:44,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 413 transitions, 1584 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-10-11 17:08:44,232 INFO L231 Difference]: Finished difference. Result has 386 places, 404 transitions, 1492 flow [2024-10-11 17:08:44,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=386, PETRI_TRANSITIONS=404} [2024-10-11 17:08:44,234 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 93 predicate places. [2024-10-11 17:08:44,234 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 404 transitions, 1492 flow [2024-10-11 17:08:44,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.66666666666666) internal successors, (1456), 6 states have internal predecessors, (1456), 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-10-11 17:08:44,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:44,236 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 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] [2024-10-11 17:08:44,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:08:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:08:44,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2054625341, now seen corresponding path program 1 times [2024-10-11 17:08:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334699726] [2024-10-11 17:08:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 4450 proven. 1897 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2024-10-11 17:08:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:08:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334699726] [2024-10-11 17:08:47,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334699726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:08:47,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275479662] [2024-10-11 17:08:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:47,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:08:47,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:08:47,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:08:47,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:08:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:08:48,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 5483 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 17:08:48,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:08:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 4450 proven. 1897 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2024-10-11 17:08:49,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:08:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8249 backedges. 4450 proven. 1897 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2024-10-11 17:08:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275479662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:08:50,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:08:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-10-11 17:08:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027802015] [2024-10-11 17:08:50,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:08:50,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 17:08:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:08:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 17:08:50,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 17:08:50,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 302 [2024-10-11 17:08:50,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 404 transitions, 1492 flow. Second operand has 34 states, 34 states have (on average 281.1764705882353) internal successors, (9560), 34 states have internal predecessors, (9560), 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-10-11 17:08:50,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:08:50,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 302 [2024-10-11 17:08:50,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:08:52,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([791] L1052-3-->L1057-2: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#c~0.base_39| (store (select |v_#pthreadsMutex_32| |v_~#c~0.base_39|) (+ 104 (* |v_gThread1of1ForFork0_~j~1#1_29| 24) |v_~#c~0.offset_37|) 0))) (= |v_gThread1of1ForFork0_#t~ret27#1_1| 0)) InVars {~#c~0.base=|v_~#c~0.base_39|, gThread1of1ForFork0_~j~1#1=|v_gThread1of1ForFork0_~j~1#1_29|, #pthreadsMutex=|v_#pthreadsMutex_32|, ~#c~0.offset=|v_~#c~0.offset_37|} OutVars{~#c~0.base=|v_~#c~0.base_39|, gThread1of1ForFork0_~j~1#1=|v_gThread1of1ForFork0_~j~1#1_29|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#c~0.offset=|v_~#c~0.offset_37|, gThread1of1ForFork0_#t~ret27#1=|v_gThread1of1ForFork0_#t~ret27#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, gThread1of1ForFork0_#t~ret27#1][342], [Black: 3515#(< |ULTIMATE.start_main_~j~2#1| 30), Black: 4471#(and (<= |ULTIMATE.start_main_~j~2#1| 29) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 4513#(and (<= |ULTIMATE.start_main_~j~2#1| 29) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 322#(= |ULTIMATE.start_main_~j~2#1| 0), Black: 3274#(<= |ULTIMATE.start_main_~j~2#1| 3), Black: 3526#(< |ULTIMATE.start_main_~j~2#1| 29), Black: 4475#(and (= 0 |ULTIMATE.start_main_#t~post31#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4465#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~2#1| 28)), 4554#true, Black: 2353#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 3798#(< |ULTIMATE.start_main_~j~2#1| 28), 213#ULTIMATE.startFINALtrue, Black: 8663#(and (= (select (select |#race| |~#c~0.base|) (+ 3 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ 2 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), 8669#true, 354#true, Black: 8655#(and (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), Black: 8659#(and (= (select (select |#race| |~#c~0.base|) (+ 2 (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0) (= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset| 1)) 0)), 296#true, Black: 8651#(= (select (select |#race| |~#c~0.base|) (+ (* |gThread1of1ForFork0_~j~1#1| 8) |~#c~0.offset|)) 0), 80#L1057-2true, Black: 358#(<= |ULTIMATE.start_main_~j~2#1| 1), Black: 937#(< |ULTIMATE.start_main_~j~2#1| 30), 1323#true, Black: 2345#(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: 2341#(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: 2333#(= (select (select |#race| |~#c~0.base|) (+ |~#c~0.offset| (* 8 |fThread1of1ForFork1_~j~0#1|))) 0), Black: 2337#(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)), 10#L1037-2true, 294#true, Black: 312#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 2355#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 4459#(and (<= |ULTIMATE.start_main_~j~2#1| 27) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 4507#(and (<= |ULTIMATE.start_main_~j~2#1| 28) (<= |ULTIMATE.start_main_~i~0#1| 1)), Black: 4453#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~j~2#1| 3)), 2351#true, Black: 4495#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~j~2#1| 3)), Black: 4501#(and (<= |ULTIMATE.start_main_~j~2#1| 27) (<= |ULTIMATE.start_main_~i~0#1| 1))]) [2024-10-11 17:08:52,936 INFO L294 olderBase$Statistics]: this new event has 2896 ancestors and is cut-off event [2024-10-11 17:08:52,936 INFO L297 olderBase$Statistics]: existing Event has 2869 ancestors and is cut-off event [2024-10-11 17:08:52,936 INFO L297 olderBase$Statistics]: existing Event has 2869 ancestors and is cut-off event [2024-10-11 17:08:52,937 INFO L297 olderBase$Statistics]: existing Event has 2869 ancestors and is cut-off event [2024-10-11 17:08:54,036 INFO L124 PetriNetUnfolderBase]: 340/6405 cut-off events. [2024-10-11 17:08:54,036 INFO L125 PetriNetUnfolderBase]: For 3561/3579 co-relation queries the response was YES. [2024-10-11 17:08:54,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8303 conditions, 6405 events. 340/6405 cut-off events. For 3561/3579 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17949 event pairs, 100 based on Foata normal form. 30/6167 useless extension candidates. Maximal degree in co-relation 5653. Up to 259 conditions per place. [2024-10-11 17:08:54,070 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 47 selfloop transitions, 135 changer transitions 0/505 dead transitions. [2024-10-11 17:08:54,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 505 transitions, 2620 flow [2024-10-11 17:08:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 17:08:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-10-11 17:08:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 12635 transitions. [2024-10-11 17:08:54,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9297277409860192 [2024-10-11 17:08:54,083 INFO L175 Difference]: Start difference. First operand has 386 places, 404 transitions, 1492 flow. Second operand 45 states and 12635 transitions. [2024-10-11 17:08:54,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 505 transitions, 2620 flow [2024-10-11 17:08:54,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 505 transitions, 2620 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:08:54,103 INFO L231 Difference]: Finished difference. Result has 439 places, 479 transitions, 2366 flow [2024-10-11 17:08:54,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2366, PETRI_PLACES=439, PETRI_TRANSITIONS=479} [2024-10-11 17:08:54,105 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 146 predicate places. [2024-10-11 17:08:54,106 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 479 transitions, 2366 flow [2024-10-11 17:08:54,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 281.1764705882353) internal successors, (9560), 34 states have internal predecessors, (9560), 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-10-11 17:08:54,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:08:54,112 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 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] [2024-10-11 17:08:54,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:08:54,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:08:54,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:08:54,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:08:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1097204419, now seen corresponding path program 2 times [2024-10-11 17:08:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:08:54,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680526183] [2024-10-11 17:08:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:08:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:08:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 39241 backedges. 20306 proven. 9465 refuted. 0 times theorem prover too weak. 9470 trivial. 0 not checked. [2024-10-11 17:09:05,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680526183] [2024-10-11 17:09:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680526183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:09:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757448860] [2024-10-11 17:09:05,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:09:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:09:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:05,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:09:05,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:09:06,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:09:06,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:09:06,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 17:09:06,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:09:07,046 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-10-11 17:09:07,074 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-10-11 17:09:07,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:09:07,107 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-10-11 17:09:07,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:09:07,160 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-10-11 17:09:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 39241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39241 trivial. 0 not checked. [2024-10-11 17:09:07,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:09:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757448860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:09:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:09:07,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [33] total 37 [2024-10-11 17:09:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257274235] [2024-10-11 17:09:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:09:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:09:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:09:07,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:09:07,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 17:09:07,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 302 [2024-10-11 17:09:07,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 479 transitions, 2366 flow. Second operand has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 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-10-11 17:09:07,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:09:07,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 302 [2024-10-11 17:09:07,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:09:11,443 INFO L124 PetriNetUnfolderBase]: 457/6665 cut-off events. [2024-10-11 17:09:11,443 INFO L125 PetriNetUnfolderBase]: For 2367/2459 co-relation queries the response was YES. [2024-10-11 17:09:11,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10611 conditions, 6665 events. 457/6665 cut-off events. For 2367/2459 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 21324 event pairs, 87 based on Foata normal form. 34/6468 useless extension candidates. Maximal degree in co-relation 7194. Up to 1847 conditions per place. [2024-10-11 17:09:11,475 INFO L140 encePairwiseOnDemand]: 291/302 looper letters, 108 selfloop transitions, 55 changer transitions 0/540 dead transitions. [2024-10-11 17:09:11,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 540 transitions, 3018 flow [2024-10-11 17:09:11,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:09:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:09:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1498 transitions. [2024-10-11 17:09:11,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.826710816777042 [2024-10-11 17:09:11,478 INFO L175 Difference]: Start difference. First operand has 439 places, 479 transitions, 2366 flow. Second operand 6 states and 1498 transitions. [2024-10-11 17:09:11,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 540 transitions, 3018 flow [2024-10-11 17:09:11,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 540 transitions, 2910 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-10-11 17:09:11,500 INFO L231 Difference]: Finished difference. Result has 431 places, 528 transitions, 2812 flow [2024-10-11 17:09:11,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2812, PETRI_PLACES=431, PETRI_TRANSITIONS=528} [2024-10-11 17:09:11,501 INFO L277 CegarLoopForPetriNet]: 293 programPoint places, 138 predicate places. [2024-10-11 17:09:11,501 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 528 transitions, 2812 flow [2024-10-11 17:09:11,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 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-10-11 17:09:11,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:09:11,504 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 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] [2024-10-11 17:09:11,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 17:09:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 17:09:11,705 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting gErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-10-11 17:09:11,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:09:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 984409217, now seen corresponding path program 1 times [2024-10-11 17:09:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:09:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85972482] [2024-10-11 17:09:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:09:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 39241 backedges. 20306 proven. 9465 refuted. 0 times theorem prover too weak. 9470 trivial. 0 not checked. [2024-10-11 17:09:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:09:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85972482] [2024-10-11 17:09:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85972482] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:09:21,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028149242] [2024-10-11 17:09:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:09:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:09:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:09:21,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:09:21,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:09:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:09:24,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 11389 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:09:24,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:09:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 39241 backedges. 20306 proven. 9465 refuted. 0 times theorem prover too weak. 9470 trivial. 0 not checked. [2024-10-11 17:09:25,669 INFO L311 TraceCheckSpWp]: Computing backward predicates...