./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:46,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:46,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:46,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:46,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:46,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:46,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:46,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:46,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:46,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:46,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:46,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:46,108 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:46,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:46,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:46,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:46,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:46,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:46,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:46,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:46,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:46,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:46,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:46,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:46,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:46,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:46,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:46,112 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b [2025-01-09 21:30:46,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:46,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:46,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:46,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:46,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:46,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-01-09 21:30:47,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ab5cfbdb/fd55a91ab82b4f9e9864e9f7f98ebc00/FLAG78db9fb59 [2025-01-09 21:30:47,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:47,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-01-09 21:30:47,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ab5cfbdb/fd55a91ab82b4f9e9864e9f7f98ebc00/FLAG78db9fb59 [2025-01-09 21:30:48,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ab5cfbdb/fd55a91ab82b4f9e9864e9f7f98ebc00 [2025-01-09 21:30:48,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:48,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:48,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:48,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:48,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:48,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fde200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48, skipping insertion in model container [2025-01-09 21:30:48,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:48,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:48,512 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:48,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:48,608 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:48,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48 WrapperNode [2025-01-09 21:30:48,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:48,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:48,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:48,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:48,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,707 INFO L138 Inliner]: procedures = 25, calls = 62, calls flagged for inlining = 29, calls inlined = 43, statements flattened = 1309 [2025-01-09 21:30:48,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:48,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:48,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:48,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:48,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:48,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:48,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:48,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:48,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:48,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:48,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:48,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:48,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:48,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:48,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:48,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:48,874 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:49,051 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:49,054 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:50,557 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:50,558 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:50,621 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:50,621 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:30:50,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:50 BoogieIcfgContainer [2025-01-09 21:30:50,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:50,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:50,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:50,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:50,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:48" (1/3) ... [2025-01-09 21:30:50,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4875a0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:50, skipping insertion in model container [2025-01-09 21:30:50,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (2/3) ... [2025-01-09 21:30:50,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4875a0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:50, skipping insertion in model container [2025-01-09 21:30:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:50" (3/3) ... [2025-01-09 21:30:50,633 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-01-09 21:30:50,649 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:50,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 1664 locations, 1 initial locations, 6 loop locations, and 225 error locations. [2025-01-09 21:30:50,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:50,957 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:51,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1673 places, 1771 transitions, 3563 flow [2025-01-09 21:30:52,201 INFO L124 PetriNetUnfolderBase]: 108/1768 cut-off events. [2025-01-09 21:30:52,204 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:52,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1768 events. 108/1768 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7603 event pairs, 0 based on Foata normal form. 0/1435 useless extension candidates. Maximal degree in co-relation 1386. Up to 2 conditions per place. [2025-01-09 21:30:52,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 1673 places, 1771 transitions, 3563 flow [2025-01-09 21:30:52,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1651 places, 1747 transitions, 3512 flow [2025-01-09 21:30:52,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:52,375 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;@23f56cdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:52,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 426 error locations. [2025-01-09 21:30:52,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:52,386 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-01-09 21:30:52,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:52,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:52,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:30:52,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -427073203, now seen corresponding path program 1 times [2025-01-09 21:30:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096950867] [2025-01-09 21:30:52,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:30:52,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:30:52,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:52,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096950867] [2025-01-09 21:30:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096950867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126267244] [2025-01-09 21:30:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-01-09 21:30:52,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1651 places, 1747 transitions, 3512 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:52,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-01-09 21:30:52,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,193 INFO L124 PetriNetUnfolderBase]: 124/2623 cut-off events. [2025-01-09 21:30:54,193 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-01-09 21:30:54,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 2623 events. 124/2623 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 14397 event pairs, 5 based on Foata normal form. 103/2203 useless extension candidates. Maximal degree in co-relation 2279. Up to 22 conditions per place. [2025-01-09 21:30:54,313 INFO L140 encePairwiseOnDemand]: 1735/1771 looper letters, 11 selfloop transitions, 2 changer transitions 6/1713 dead transitions. [2025-01-09 21:30:54,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1652 places, 1713 transitions, 3470 flow [2025-01-09 21:30:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5210 transitions. [2025-01-09 21:30:54,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9806135893092415 [2025-01-09 21:30:54,345 INFO L175 Difference]: Start difference. First operand has 1651 places, 1747 transitions, 3512 flow. Second operand 3 states and 5210 transitions. [2025-01-09 21:30:54,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1652 places, 1713 transitions, 3470 flow [2025-01-09 21:30:54,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1646 places, 1713 transitions, 3458 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:54,397 INFO L231 Difference]: Finished difference. Result has 1646 places, 1707 transitions, 3424 flow [2025-01-09 21:30:54,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=1644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3424, PETRI_PLACES=1646, PETRI_TRANSITIONS=1707} [2025-01-09 21:30:54,407 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -5 predicate places. [2025-01-09 21:30:54,407 INFO L471 AbstractCegarLoop]: Abstraction has has 1646 places, 1707 transitions, 3424 flow [2025-01-09 21:30:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:54,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:54,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:54,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:30:54,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 567369923, now seen corresponding path program 1 times [2025-01-09 21:30:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047559458] [2025-01-09 21:30:54,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:30:54,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:30:54,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:54,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047559458] [2025-01-09 21:30:54,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047559458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086778540] [2025-01-09 21:30:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-01-09 21:30:54,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1646 places, 1707 transitions, 3424 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:54,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-01-09 21:30:54,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,592 INFO L124 PetriNetUnfolderBase]: 124/2616 cut-off events. [2025-01-09 21:30:55,592 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:55,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 2616 events. 124/2616 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14944 event pairs, 5 based on Foata normal form. 0/2101 useless extension candidates. Maximal degree in co-relation 2603. Up to 22 conditions per place. [2025-01-09 21:30:55,701 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1706 dead transitions. [2025-01-09 21:30:55,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1641 places, 1706 transitions, 3448 flow [2025-01-09 21:30:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-01-09 21:30:55,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-01-09 21:30:55,712 INFO L175 Difference]: Start difference. First operand has 1646 places, 1707 transitions, 3424 flow. Second operand 3 states and 5177 transitions. [2025-01-09 21:30:55,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1641 places, 1706 transitions, 3448 flow [2025-01-09 21:30:55,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1639 places, 1706 transitions, 3444 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,738 INFO L231 Difference]: Finished difference. Result has 1639 places, 1706 transitions, 3422 flow [2025-01-09 21:30:55,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3418, PETRI_DIFFERENCE_MINUEND_PLACES=1637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3422, PETRI_PLACES=1639, PETRI_TRANSITIONS=1706} [2025-01-09 21:30:55,741 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -12 predicate places. [2025-01-09 21:30:55,741 INFO L471 AbstractCegarLoop]: Abstraction has has 1639 places, 1706 transitions, 3422 flow [2025-01-09 21:30:55,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:55,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:55,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:55,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:30:55,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 204137864, now seen corresponding path program 1 times [2025-01-09 21:30:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282618811] [2025-01-09 21:30:55,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:30:55,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:30:55,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282618811] [2025-01-09 21:30:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282618811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921971409] [2025-01-09 21:30:55,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-01-09 21:30:55,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1639 places, 1706 transitions, 3422 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:55,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-01-09 21:30:55,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:57,612 INFO L124 PetriNetUnfolderBase]: 172/3516 cut-off events. [2025-01-09 21:30:57,613 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:57,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 3516 events. 172/3516 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 21436 event pairs, 7 based on Foata normal form. 0/2805 useless extension candidates. Maximal degree in co-relation 3500. Up to 25 conditions per place. [2025-01-09 21:30:57,798 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1705 dead transitions. [2025-01-09 21:30:57,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1640 places, 1705 transitions, 3446 flow [2025-01-09 21:30:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-01-09 21:30:57,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-01-09 21:30:57,810 INFO L175 Difference]: Start difference. First operand has 1639 places, 1706 transitions, 3422 flow. Second operand 3 states and 5177 transitions. [2025-01-09 21:30:57,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1640 places, 1705 transitions, 3446 flow [2025-01-09 21:30:57,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1638 places, 1705 transitions, 3442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:57,841 INFO L231 Difference]: Finished difference. Result has 1638 places, 1705 transitions, 3420 flow [2025-01-09 21:30:57,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3416, PETRI_DIFFERENCE_MINUEND_PLACES=1636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3420, PETRI_PLACES=1638, PETRI_TRANSITIONS=1705} [2025-01-09 21:30:57,846 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -13 predicate places. [2025-01-09 21:30:57,846 INFO L471 AbstractCegarLoop]: Abstraction has has 1638 places, 1705 transitions, 3420 flow [2025-01-09 21:30:57,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:57,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:57,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:57,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:57,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:30:57,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash -497014800, now seen corresponding path program 1 times [2025-01-09 21:30:57,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:57,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827591416] [2025-01-09 21:30:57,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:57,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:30:57,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:30:57,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:57,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:57,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827591416] [2025-01-09 21:30:57,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827591416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363398562] [2025-01-09 21:30:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:57,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:57,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-01-09 21:30:57,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1638 places, 1705 transitions, 3420 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:57,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-01-09 21:30:57,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:59,134 INFO L124 PetriNetUnfolderBase]: 172/3515 cut-off events. [2025-01-09 21:30:59,134 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:30:59,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3515 events. 172/3515 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22625 event pairs, 7 based on Foata normal form. 0/2806 useless extension candidates. Maximal degree in co-relation 3491. Up to 25 conditions per place. [2025-01-09 21:30:59,286 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1704 dead transitions. [2025-01-09 21:30:59,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1639 places, 1704 transitions, 3444 flow [2025-01-09 21:30:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-01-09 21:30:59,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-01-09 21:30:59,294 INFO L175 Difference]: Start difference. First operand has 1638 places, 1705 transitions, 3420 flow. Second operand 3 states and 5177 transitions. [2025-01-09 21:30:59,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1639 places, 1704 transitions, 3444 flow [2025-01-09 21:30:59,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1637 places, 1704 transitions, 3440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:59,318 INFO L231 Difference]: Finished difference. Result has 1637 places, 1704 transitions, 3418 flow [2025-01-09 21:30:59,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3414, PETRI_DIFFERENCE_MINUEND_PLACES=1635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3418, PETRI_PLACES=1637, PETRI_TRANSITIONS=1704} [2025-01-09 21:30:59,322 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -14 predicate places. [2025-01-09 21:30:59,322 INFO L471 AbstractCegarLoop]: Abstraction has has 1637 places, 1704 transitions, 3418 flow [2025-01-09 21:30:59,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:59,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:59,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:59,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:59,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:30:59,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash 223710672, now seen corresponding path program 1 times [2025-01-09 21:30:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657758087] [2025-01-09 21:30:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:59,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:30:59,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:30:59,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:59,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657758087] [2025-01-09 21:30:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657758087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:59,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123332430] [2025-01-09 21:30:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:59,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:59,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:59,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:59,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-01-09 21:30:59,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1637 places, 1704 transitions, 3418 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:30:59,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:59,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-01-09 21:30:59,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:00,225 INFO L124 PetriNetUnfolderBase]: 103/2164 cut-off events. [2025-01-09 21:31:00,225 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:31:00,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 2164 events. 103/2164 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10811 event pairs, 7 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 2129. Up to 25 conditions per place. [2025-01-09 21:31:00,316 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1703 dead transitions. [2025-01-09 21:31:00,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1638 places, 1703 transitions, 3442 flow [2025-01-09 21:31:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:00,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-01-09 21:31:00,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-01-09 21:31:00,324 INFO L175 Difference]: Start difference. First operand has 1637 places, 1704 transitions, 3418 flow. Second operand 3 states and 5177 transitions. [2025-01-09 21:31:00,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1638 places, 1703 transitions, 3442 flow [2025-01-09 21:31:00,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1636 places, 1703 transitions, 3438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:00,348 INFO L231 Difference]: Finished difference. Result has 1636 places, 1703 transitions, 3416 flow [2025-01-09 21:31:00,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3412, PETRI_DIFFERENCE_MINUEND_PLACES=1634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3416, PETRI_PLACES=1636, PETRI_TRANSITIONS=1703} [2025-01-09 21:31:00,352 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -15 predicate places. [2025-01-09 21:31:00,352 INFO L471 AbstractCegarLoop]: Abstraction has has 1636 places, 1703 transitions, 3416 flow [2025-01-09 21:31:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:31:00,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:00,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:00,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:00,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:00,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1978836661, now seen corresponding path program 1 times [2025-01-09 21:31:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:00,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233886442] [2025-01-09 21:31:00,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:00,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:31:00,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:31:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:00,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:00,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:00,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233886442] [2025-01-09 21:31:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233886442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:00,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375175224] [2025-01-09 21:31:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:00,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:00,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:00,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-01-09 21:31:00,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1636 places, 1703 transitions, 3416 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:31:00,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:00,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-01-09 21:31:00,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:01,261 INFO L124 PetriNetUnfolderBase]: 103/2163 cut-off events. [2025-01-09 21:31:01,261 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:31:01,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 2163 events. 103/2163 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11173 event pairs, 7 based on Foata normal form. 0/1750 useless extension candidates. Maximal degree in co-relation 2120. Up to 25 conditions per place. [2025-01-09 21:31:01,330 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1702 dead transitions. [2025-01-09 21:31:01,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1637 places, 1702 transitions, 3440 flow [2025-01-09 21:31:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-01-09 21:31:01,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-01-09 21:31:01,336 INFO L175 Difference]: Start difference. First operand has 1636 places, 1703 transitions, 3416 flow. Second operand 3 states and 5177 transitions. [2025-01-09 21:31:01,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1637 places, 1702 transitions, 3440 flow [2025-01-09 21:31:01,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1635 places, 1702 transitions, 3436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:01,360 INFO L231 Difference]: Finished difference. Result has 1635 places, 1702 transitions, 3414 flow [2025-01-09 21:31:01,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3410, PETRI_DIFFERENCE_MINUEND_PLACES=1633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3414, PETRI_PLACES=1635, PETRI_TRANSITIONS=1702} [2025-01-09 21:31:01,364 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -16 predicate places. [2025-01-09 21:31:01,364 INFO L471 AbstractCegarLoop]: Abstraction has has 1635 places, 1702 transitions, 3414 flow [2025-01-09 21:31:01,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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) [2025-01-09 21:31:01,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:01,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:01,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:01,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash -473260856, now seen corresponding path program 1 times [2025-01-09 21:31:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681927012] [2025-01-09 21:31:01,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:31:01,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:31:01,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:01,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681927012] [2025-01-09 21:31:01,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681927012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:01,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:01,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:01,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109371400] [2025-01-09 21:31:01,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:01,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:01,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1713 out of 1771 [2025-01-09 21:31:01,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1635 places, 1702 transitions, 3414 flow. Second operand has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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) [2025-01-09 21:31:01,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1713 of 1771 [2025-01-09 21:31:01,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:05,122 INFO L124 PetriNetUnfolderBase]: 505/9846 cut-off events. [2025-01-09 21:31:05,122 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:31:05,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9929 conditions, 9846 events. 505/9846 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 88722 event pairs, 18 based on Foata normal form. 0/7772 useless extension candidates. Maximal degree in co-relation 9843. Up to 56 conditions per place. [2025-01-09 21:31:05,388 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 19 selfloop transitions, 2 changer transitions 0/1701 dead transitions. [2025-01-09 21:31:05,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1636 places, 1701 transitions, 3454 flow [2025-01-09 21:31:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5161 transitions. [2025-01-09 21:31:05,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971390927912667 [2025-01-09 21:31:05,395 INFO L175 Difference]: Start difference. First operand has 1635 places, 1702 transitions, 3414 flow. Second operand 3 states and 5161 transitions. [2025-01-09 21:31:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1636 places, 1701 transitions, 3454 flow [2025-01-09 21:31:05,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1634 places, 1701 transitions, 3450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:05,418 INFO L231 Difference]: Finished difference. Result has 1634 places, 1701 transitions, 3412 flow [2025-01-09 21:31:05,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3408, PETRI_DIFFERENCE_MINUEND_PLACES=1632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3412, PETRI_PLACES=1634, PETRI_TRANSITIONS=1701} [2025-01-09 21:31:05,422 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -17 predicate places. [2025-01-09 21:31:05,422 INFO L471 AbstractCegarLoop]: Abstraction has has 1634 places, 1701 transitions, 3412 flow [2025-01-09 21:31:05,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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) [2025-01-09 21:31:05,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:05,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:05,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:31:05,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:05,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1502584510, now seen corresponding path program 1 times [2025-01-09 21:31:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672450439] [2025-01-09 21:31:05,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:05,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:05,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:31:05,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:31:05,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:05,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:05,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672450439] [2025-01-09 21:31:05,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672450439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:05,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:05,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:05,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217611345] [2025-01-09 21:31:05,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:05,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:05,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:05,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:05,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 1771 [2025-01-09 21:31:05,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1634 places, 1701 transitions, 3412 flow. Second operand has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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) [2025-01-09 21:31:05,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:05,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 1771 [2025-01-09 21:31:05,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:11,341 INFO L124 PetriNetUnfolderBase]: 793/15275 cut-off events. [2025-01-09 21:31:11,342 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-01-09 21:31:11,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 15275 events. 793/15275 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 154213 event pairs, 30 based on Foata normal form. 0/12028 useless extension candidates. Maximal degree in co-relation 15305. Up to 85 conditions per place. [2025-01-09 21:31:11,999 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 24 selfloop transitions, 2 changer transitions 0/1700 dead transitions. [2025-01-09 21:31:11,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1635 places, 1700 transitions, 3462 flow [2025-01-09 21:31:11,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5151 transitions. [2025-01-09 21:31:12,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695087521174478 [2025-01-09 21:31:12,004 INFO L175 Difference]: Start difference. First operand has 1634 places, 1701 transitions, 3412 flow. Second operand 3 states and 5151 transitions. [2025-01-09 21:31:12,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1635 places, 1700 transitions, 3462 flow [2025-01-09 21:31:12,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1633 places, 1700 transitions, 3458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:12,021 INFO L231 Difference]: Finished difference. Result has 1633 places, 1700 transitions, 3410 flow [2025-01-09 21:31:12,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3406, PETRI_DIFFERENCE_MINUEND_PLACES=1631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3410, PETRI_PLACES=1633, PETRI_TRANSITIONS=1700} [2025-01-09 21:31:12,023 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -18 predicate places. [2025-01-09 21:31:12,023 INFO L471 AbstractCegarLoop]: Abstraction has has 1633 places, 1700 transitions, 3410 flow [2025-01-09 21:31:12,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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) [2025-01-09 21:31:12,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:12,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:12,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:31:12,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash 184613833, now seen corresponding path program 1 times [2025-01-09 21:31:12,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:12,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898701757] [2025-01-09 21:31:12,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:12,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 21:31:12,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 21:31:12,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:12,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898701757] [2025-01-09 21:31:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898701757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:12,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:12,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533300355] [2025-01-09 21:31:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:12,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:12,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:12,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:12,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1713 out of 1771 [2025-01-09 21:31:12,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1633 places, 1700 transitions, 3410 flow. Second operand has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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) [2025-01-09 21:31:12,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:12,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1713 of 1771 [2025-01-09 21:31:12,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,002 INFO L124 PetriNetUnfolderBase]: 298/5776 cut-off events. [2025-01-09 21:31:15,003 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-01-09 21:31:15,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 5776 events. 298/5776 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 42652 event pairs, 18 based on Foata normal form. 0/4581 useless extension candidates. Maximal degree in co-relation 5748. Up to 56 conditions per place. [2025-01-09 21:31:15,223 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 19 selfloop transitions, 2 changer transitions 0/1699 dead transitions. [2025-01-09 21:31:15,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1634 places, 1699 transitions, 3450 flow [2025-01-09 21:31:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5161 transitions. [2025-01-09 21:31:15,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971390927912667 [2025-01-09 21:31:15,231 INFO L175 Difference]: Start difference. First operand has 1633 places, 1700 transitions, 3410 flow. Second operand 3 states and 5161 transitions. [2025-01-09 21:31:15,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1634 places, 1699 transitions, 3450 flow [2025-01-09 21:31:15,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1632 places, 1699 transitions, 3446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,253 INFO L231 Difference]: Finished difference. Result has 1632 places, 1699 transitions, 3408 flow [2025-01-09 21:31:15,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3404, PETRI_DIFFERENCE_MINUEND_PLACES=1630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3408, PETRI_PLACES=1632, PETRI_TRANSITIONS=1699} [2025-01-09 21:31:15,257 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -19 predicate places. [2025-01-09 21:31:15,257 INFO L471 AbstractCegarLoop]: Abstraction has has 1632 places, 1699 transitions, 3408 flow [2025-01-09 21:31:15,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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) [2025-01-09 21:31:15,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:31:15,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:15,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash 120962030, now seen corresponding path program 1 times [2025-01-09 21:31:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925378472] [2025-01-09 21:31:15,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:31:15,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:31:15,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925378472] [2025-01-09 21:31:15,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925378472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282999631] [2025-01-09 21:31:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 1771 [2025-01-09 21:31:15,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1632 places, 1699 transitions, 3408 flow. Second operand has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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) [2025-01-09 21:31:15,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 1771 [2025-01-09 21:31:15,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:19,276 INFO L124 PetriNetUnfolderBase]: 448/8493 cut-off events. [2025-01-09 21:31:19,276 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-01-09 21:31:19,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 8493 events. 448/8493 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 71492 event pairs, 30 based on Foata normal form. 0/6710 useless extension candidates. Maximal degree in co-relation 8492. Up to 85 conditions per place. [2025-01-09 21:31:19,595 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 24 selfloop transitions, 2 changer transitions 0/1698 dead transitions. [2025-01-09 21:31:19,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1633 places, 1698 transitions, 3458 flow [2025-01-09 21:31:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5151 transitions. [2025-01-09 21:31:19,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695087521174478 [2025-01-09 21:31:19,600 INFO L175 Difference]: Start difference. First operand has 1632 places, 1699 transitions, 3408 flow. Second operand 3 states and 5151 transitions. [2025-01-09 21:31:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1633 places, 1698 transitions, 3458 flow [2025-01-09 21:31:19,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1631 places, 1698 transitions, 3454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:19,616 INFO L231 Difference]: Finished difference. Result has 1631 places, 1698 transitions, 3406 flow [2025-01-09 21:31:19,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=1629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3406, PETRI_PLACES=1631, PETRI_TRANSITIONS=1698} [2025-01-09 21:31:19,619 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -20 predicate places. [2025-01-09 21:31:19,619 INFO L471 AbstractCegarLoop]: Abstraction has has 1631 places, 1698 transitions, 3406 flow [2025-01-09 21:31:19,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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) [2025-01-09 21:31:19,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:19,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:19,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:31:19,621 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash -540411119, now seen corresponding path program 1 times [2025-01-09 21:31:19,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:19,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225815335] [2025-01-09 21:31:19,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:19,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 21:31:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 21:31:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:19,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225815335] [2025-01-09 21:31:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225815335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:19,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245651049] [2025-01-09 21:31:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:19,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:19,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:19,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:19,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1713 out of 1771 [2025-01-09 21:31:19,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1631 places, 1698 transitions, 3406 flow. Second operand has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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) [2025-01-09 21:31:19,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:19,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1713 of 1771 [2025-01-09 21:31:19,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:20,397 INFO L124 PetriNetUnfolderBase]: 91/1733 cut-off events. [2025-01-09 21:31:20,397 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-01-09 21:31:20,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1733 events. 91/1733 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8556 event pairs, 18 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1680. Up to 56 conditions per place. [2025-01-09 21:31:20,444 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 19 selfloop transitions, 2 changer transitions 0/1697 dead transitions. [2025-01-09 21:31:20,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1632 places, 1697 transitions, 3446 flow [2025-01-09 21:31:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5161 transitions. [2025-01-09 21:31:20,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971390927912667 [2025-01-09 21:31:20,449 INFO L175 Difference]: Start difference. First operand has 1631 places, 1698 transitions, 3406 flow. Second operand 3 states and 5161 transitions. [2025-01-09 21:31:20,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1632 places, 1697 transitions, 3446 flow [2025-01-09 21:31:20,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1630 places, 1697 transitions, 3442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:20,462 INFO L231 Difference]: Finished difference. Result has 1630 places, 1697 transitions, 3404 flow [2025-01-09 21:31:20,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3400, PETRI_DIFFERENCE_MINUEND_PLACES=1628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3404, PETRI_PLACES=1630, PETRI_TRANSITIONS=1697} [2025-01-09 21:31:20,463 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -21 predicate places. [2025-01-09 21:31:20,463 INFO L471 AbstractCegarLoop]: Abstraction has has 1630 places, 1697 transitions, 3404 flow [2025-01-09 21:31:20,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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) [2025-01-09 21:31:20,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:20,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:20,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:31:20,465 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1089924969, now seen corresponding path program 1 times [2025-01-09 21:31:20,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:20,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13860166] [2025-01-09 21:31:20,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:20,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:20,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 21:31:20,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 21:31:20,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:20,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13860166] [2025-01-09 21:31:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13860166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912350525] [2025-01-09 21:31:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:20,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:20,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 1771 [2025-01-09 21:31:20,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1630 places, 1697 transitions, 3404 flow. Second operand has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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) [2025-01-09 21:31:20,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:20,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 1771 [2025-01-09 21:31:20,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:21,545 INFO L124 PetriNetUnfolderBase]: 136/2393 cut-off events. [2025-01-09 21:31:21,545 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-01-09 21:31:21,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 2393 events. 136/2393 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13912 event pairs, 30 based on Foata normal form. 0/1933 useless extension candidates. Maximal degree in co-relation 2362. Up to 86 conditions per place. [2025-01-09 21:31:21,615 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 24 selfloop transitions, 2 changer transitions 0/1696 dead transitions. [2025-01-09 21:31:21,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1631 places, 1696 transitions, 3454 flow [2025-01-09 21:31:21,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5151 transitions. [2025-01-09 21:31:21,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695087521174478 [2025-01-09 21:31:21,623 INFO L175 Difference]: Start difference. First operand has 1630 places, 1697 transitions, 3404 flow. Second operand 3 states and 5151 transitions. [2025-01-09 21:31:21,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1631 places, 1696 transitions, 3454 flow [2025-01-09 21:31:21,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1629 places, 1696 transitions, 3450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:21,640 INFO L231 Difference]: Finished difference. Result has 1629 places, 1696 transitions, 3402 flow [2025-01-09 21:31:21,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=1627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3402, PETRI_PLACES=1629, PETRI_TRANSITIONS=1696} [2025-01-09 21:31:21,641 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -22 predicate places. [2025-01-09 21:31:21,642 INFO L471 AbstractCegarLoop]: Abstraction has has 1629 places, 1696 transitions, 3402 flow [2025-01-09 21:31:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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) [2025-01-09 21:31:21,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:21,643 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:21,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:31:21,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:21,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1077498747, now seen corresponding path program 1 times [2025-01-09 21:31:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:21,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827892415] [2025-01-09 21:31:21,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:21,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 21:31:21,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 21:31:21,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:21,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827892415] [2025-01-09 21:31:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827892415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512243145] [2025-01-09 21:31:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:21,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:21,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:21,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1715 out of 1771 [2025-01-09 21:31:21,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1629 places, 1696 transitions, 3402 flow. Second operand has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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) [2025-01-09 21:31:21,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:21,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1715 of 1771 [2025-01-09 21:31:21,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:24,141 INFO L124 PetriNetUnfolderBase]: 335/6219 cut-off events. [2025-01-09 21:31:24,141 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-01-09 21:31:24,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 6219 events. 335/6219 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 52208 event pairs, 32 based on Foata normal form. 0/4940 useless extension candidates. Maximal degree in co-relation 6184. Up to 82 conditions per place. [2025-01-09 21:31:24,324 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 17 selfloop transitions, 2 changer transitions 0/1695 dead transitions. [2025-01-09 21:31:24,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1630 places, 1695 transitions, 3438 flow [2025-01-09 21:31:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5165 transitions. [2025-01-09 21:31:24,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721437982307548 [2025-01-09 21:31:24,328 INFO L175 Difference]: Start difference. First operand has 1629 places, 1696 transitions, 3402 flow. Second operand 3 states and 5165 transitions. [2025-01-09 21:31:24,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1630 places, 1695 transitions, 3438 flow [2025-01-09 21:31:24,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1628 places, 1695 transitions, 3434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:24,511 INFO L231 Difference]: Finished difference. Result has 1628 places, 1695 transitions, 3400 flow [2025-01-09 21:31:24,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3396, PETRI_DIFFERENCE_MINUEND_PLACES=1626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3400, PETRI_PLACES=1628, PETRI_TRANSITIONS=1695} [2025-01-09 21:31:24,513 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -23 predicate places. [2025-01-09 21:31:24,513 INFO L471 AbstractCegarLoop]: Abstraction has has 1628 places, 1695 transitions, 3400 flow [2025-01-09 21:31:24,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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) [2025-01-09 21:31:24,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:24,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:24,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:31:24,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:24,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1342488317, now seen corresponding path program 1 times [2025-01-09 21:31:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455106976] [2025-01-09 21:31:24,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:24,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:24,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:31:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:31:24,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:24,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455106976] [2025-01-09 21:31:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455106976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:24,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:24,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:24,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017402849] [2025-01-09 21:31:24,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:24,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:24,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:24,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:24,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:24,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1715 out of 1771 [2025-01-09 21:31:24,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1628 places, 1695 transitions, 3400 flow. Second operand has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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) [2025-01-09 21:31:24,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:24,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1715 of 1771 [2025-01-09 21:31:24,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:26,925 INFO L124 PetriNetUnfolderBase]: 459/8010 cut-off events. [2025-01-09 21:31:26,925 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-01-09 21:31:27,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 8010 events. 459/8010 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 75502 event pairs, 64 based on Foata normal form. 0/6333 useless extension candidates. Maximal degree in co-relation 8035. Up to 130 conditions per place. [2025-01-09 21:31:27,117 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 17 selfloop transitions, 2 changer transitions 0/1694 dead transitions. [2025-01-09 21:31:27,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1629 places, 1694 transitions, 3436 flow [2025-01-09 21:31:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5165 transitions. [2025-01-09 21:31:27,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721437982307548 [2025-01-09 21:31:27,120 INFO L175 Difference]: Start difference. First operand has 1628 places, 1695 transitions, 3400 flow. Second operand 3 states and 5165 transitions. [2025-01-09 21:31:27,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1629 places, 1694 transitions, 3436 flow [2025-01-09 21:31:27,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1627 places, 1694 transitions, 3432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:27,134 INFO L231 Difference]: Finished difference. Result has 1627 places, 1694 transitions, 3398 flow [2025-01-09 21:31:27,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3394, PETRI_DIFFERENCE_MINUEND_PLACES=1625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3398, PETRI_PLACES=1627, PETRI_TRANSITIONS=1694} [2025-01-09 21:31:27,136 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -24 predicate places. [2025-01-09 21:31:27,136 INFO L471 AbstractCegarLoop]: Abstraction has has 1627 places, 1694 transitions, 3398 flow [2025-01-09 21:31:27,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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) [2025-01-09 21:31:27,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:27,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:31:27,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1144724502, now seen corresponding path program 1 times [2025-01-09 21:31:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:27,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615020615] [2025-01-09 21:31:27,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:27,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:31:27,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:31:27,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:27,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615020615] [2025-01-09 21:31:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615020615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:27,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198644150] [2025-01-09 21:31:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:27,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:27,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:27,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:27,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1715 out of 1771 [2025-01-09 21:31:27,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1627 places, 1694 transitions, 3398 flow. Second operand has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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) [2025-01-09 21:31:27,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:27,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1715 of 1771 [2025-01-09 21:31:27,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:29,185 INFO L124 PetriNetUnfolderBase]: 316/5272 cut-off events. [2025-01-09 21:31:29,186 INFO L125 PetriNetUnfolderBase]: For 29/70 co-relation queries the response was YES. [2025-01-09 21:31:29,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 5272 events. 316/5272 cut-off events. For 29/70 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 41626 event pairs, 64 based on Foata normal form. 0/4199 useless extension candidates. Maximal degree in co-relation 5274. Up to 139 conditions per place. [2025-01-09 21:31:29,346 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 17 selfloop transitions, 2 changer transitions 0/1693 dead transitions. [2025-01-09 21:31:29,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1628 places, 1693 transitions, 3434 flow [2025-01-09 21:31:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5165 transitions. [2025-01-09 21:31:29,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721437982307548 [2025-01-09 21:31:29,349 INFO L175 Difference]: Start difference. First operand has 1627 places, 1694 transitions, 3398 flow. Second operand 3 states and 5165 transitions. [2025-01-09 21:31:29,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1628 places, 1693 transitions, 3434 flow [2025-01-09 21:31:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1626 places, 1693 transitions, 3430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:29,361 INFO L231 Difference]: Finished difference. Result has 1626 places, 1693 transitions, 3396 flow [2025-01-09 21:31:29,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3392, PETRI_DIFFERENCE_MINUEND_PLACES=1624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3396, PETRI_PLACES=1626, PETRI_TRANSITIONS=1693} [2025-01-09 21:31:29,363 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -25 predicate places. [2025-01-09 21:31:29,363 INFO L471 AbstractCegarLoop]: Abstraction has has 1626 places, 1693 transitions, 3396 flow [2025-01-09 21:31:29,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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) [2025-01-09 21:31:29,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:29,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:31:29,364 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err57ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err58ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-01-09 21:31:29,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash 414401363, now seen corresponding path program 1 times [2025-01-09 21:31:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:29,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318539051] [2025-01-09 21:31:29,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:29,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:31:29,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:31:29,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:29,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:29,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318539051] [2025-01-09 21:31:29,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318539051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:29,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:29,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228287226] [2025-01-09 21:31:29,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:29,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:29,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:29,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:29,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1709 out of 1771 [2025-01-09 21:31:29,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1626 places, 1693 transitions, 3396 flow. Second operand has 3 states, 3 states have (on average 1710.3333333333333) internal successors, (5131), 3 states have internal predecessors, (5131), 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) [2025-01-09 21:31:29,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:29,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1709 of 1771 [2025-01-09 21:31:29,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand