./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:45:07,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:45:07,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:45:07,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:45:07,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:45:07,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:45:07,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:45:07,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:45:07,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:45:07,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:45:07,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:45:07,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:45:07,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:45:07,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:45:07,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:45:07,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:45:07,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:45:07,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:45:07,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:45:07,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:45:07,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:45:07,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:45:07,307 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:45:07,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:45:07,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:45:07,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:45:07,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:45:07,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:45:07,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:45:07,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:45:07,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:45:07,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:45:07,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:45:07,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:45:07,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:45:07,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:45:07,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:45:07,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:45:07,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:45:07,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:45:07,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:45:07,312 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 [2024-11-16 23:45:07,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:45:07,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:45:07,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:45:07,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:45:07,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:45:07,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2024-11-16 23:45:08,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:45:09,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:45:09,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2024-11-16 23:45:09,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddc03813/37739d7e888b4152b4fa5940ffe0d193/FLAG725aed122 [2024-11-16 23:45:09,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ddc03813/37739d7e888b4152b4fa5940ffe0d193 [2024-11-16 23:45:09,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:45:09,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:45:09,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:45:09,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:45:09,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:45:09,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619896eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09, skipping insertion in model container [2024-11-16 23:45:09,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:45:09,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:45:09,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:45:09,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:45:09,425 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:45:09,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09 WrapperNode [2024-11-16 23:45:09,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:45:09,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:45:09,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:45:09,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:45:09,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,477 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 631 [2024-11-16 23:45:09,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:45:09,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:45:09,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:45:09,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:45:09,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:45:09,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:45:09,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:45:09,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:45:09,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (1/1) ... [2024-11-16 23:45:09,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:45:09,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:45:09,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:45:09,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:45:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:45:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:45:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:45:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:45:09,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:45:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:45:09,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:45:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:45:09,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:45:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-16 23:45:09,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-16 23:45:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:45:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-16 23:45:09,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-16 23:45:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-16 23:45:09,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-16 23:45:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 23:45:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 23:45:09,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:45:09,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:45:09,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:45:09,591 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:45:09,710 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:45:09,712 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:45:10,317 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:45:10,318 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:45:10,694 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:45:10,694 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:45:10,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:45:10 BoogieIcfgContainer [2024-11-16 23:45:10,716 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:45:10,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:45:10,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:45:10,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:45:10,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:45:09" (1/3) ... [2024-11-16 23:45:10,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fec907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:45:10, skipping insertion in model container [2024-11-16 23:45:10,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:09" (2/3) ... [2024-11-16 23:45:10,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fec907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:45:10, skipping insertion in model container [2024-11-16 23:45:10,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:45:10" (3/3) ... [2024-11-16 23:45:10,729 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2024-11-16 23:45:10,748 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:45:10,748 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-16 23:45:10,748 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:45:10,871 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-16 23:45:10,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 514 places, 523 transitions, 1112 flow [2024-11-16 23:45:11,058 INFO L124 PetriNetUnfolderBase]: 26/473 cut-off events. [2024-11-16 23:45:11,058 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:45:11,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 473 events. 26/473 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 840 event pairs, 0 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 415. Up to 3 conditions per place. [2024-11-16 23:45:11,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 514 places, 523 transitions, 1112 flow [2024-11-16 23:45:11,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 450 places, 456 transitions, 960 flow [2024-11-16 23:45:11,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:45:11,092 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;@4d7742e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:45:11,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2024-11-16 23:45:11,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:45:11,097 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-11-16 23:45:11,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:45:11,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:11,098 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:11,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:11,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -103364801, now seen corresponding path program 1 times [2024-11-16 23:45:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:11,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006633750] [2024-11-16 23:45:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:11,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:11,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006633750] [2024-11-16 23:45:11,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006633750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:11,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013454260] [2024-11-16 23:45:11,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:11,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:11,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-16 23:45:11,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 456 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:11,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:11,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-16 23:45:11,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:12,117 INFO L124 PetriNetUnfolderBase]: 1299/4038 cut-off events. [2024-11-16 23:45:12,117 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-11-16 23:45:12,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 4038 events. 1299/4038 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 30511 event pairs, 526 based on Foata normal form. 565/3832 useless extension candidates. Maximal degree in co-relation 6108. Up to 1640 conditions per place. [2024-11-16 23:45:12,154 INFO L140 encePairwiseOnDemand]: 463/527 looper letters, 31 selfloop transitions, 2 changer transitions 4/394 dead transitions. [2024-11-16 23:45:12,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 394 transitions, 902 flow [2024-11-16 23:45:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1325 transitions. [2024-11-16 23:45:12,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8380771663504112 [2024-11-16 23:45:12,175 INFO L175 Difference]: Start difference. First operand has 450 places, 456 transitions, 960 flow. Second operand 3 states and 1325 transitions. [2024-11-16 23:45:12,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 394 transitions, 902 flow [2024-11-16 23:45:12,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 394 transitions, 870 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-16 23:45:12,192 INFO L231 Difference]: Finished difference. Result has 389 places, 390 transitions, 800 flow [2024-11-16 23:45:12,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=389, PETRI_TRANSITIONS=390} [2024-11-16 23:45:12,200 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -61 predicate places. [2024-11-16 23:45:12,200 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 390 transitions, 800 flow [2024-11-16 23:45:12,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:12,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:12,202 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:45:12,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash 271389411, now seen corresponding path program 1 times [2024-11-16 23:45:12,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:12,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904069640] [2024-11-16 23:45:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:12,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:12,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904069640] [2024-11-16 23:45:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904069640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870386854] [2024-11-16 23:45:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:12,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:12,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-16 23:45:12,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 390 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:12,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:12,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-16 23:45:12,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:12,900 INFO L124 PetriNetUnfolderBase]: 1292/3933 cut-off events. [2024-11-16 23:45:12,901 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2024-11-16 23:45:12,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 3933 events. 1292/3933 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29230 event pairs, 521 based on Foata normal form. 0/3190 useless extension candidates. Maximal degree in co-relation 5682. Up to 1631 conditions per place. [2024-11-16 23:45:12,921 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 31 selfloop transitions, 2 changer transitions 0/389 dead transitions. [2024-11-16 23:45:12,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 389 transitions, 864 flow [2024-11-16 23:45:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-11-16 23:45:12,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.799493991144845 [2024-11-16 23:45:12,924 INFO L175 Difference]: Start difference. First operand has 389 places, 390 transitions, 800 flow. Second operand 3 states and 1264 transitions. [2024-11-16 23:45:12,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 389 transitions, 864 flow [2024-11-16 23:45:12,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 389 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:12,928 INFO L231 Difference]: Finished difference. Result has 384 places, 389 transitions, 798 flow [2024-11-16 23:45:12,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=384, PETRI_TRANSITIONS=389} [2024-11-16 23:45:12,929 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -66 predicate places. [2024-11-16 23:45:12,930 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 389 transitions, 798 flow [2024-11-16 23:45:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:12,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:12,930 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:45:12,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash -478593017, now seen corresponding path program 1 times [2024-11-16 23:45:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631719446] [2024-11-16 23:45:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:12,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631719446] [2024-11-16 23:45:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631719446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169202226] [2024-11-16 23:45:12,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:12,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:12,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-16 23:45:12,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 389 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:12,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:12,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-16 23:45:12,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:13,493 INFO L124 PetriNetUnfolderBase]: 1245/3790 cut-off events. [2024-11-16 23:45:13,493 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:13,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 3790 events. 1245/3790 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27817 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5459. Up to 1563 conditions per place. [2024-11-16 23:45:13,517 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2024-11-16 23:45:13,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 388 transitions, 858 flow [2024-11-16 23:45:13,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-16 23:45:13,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-16 23:45:13,520 INFO L175 Difference]: Start difference. First operand has 384 places, 389 transitions, 798 flow. Second operand 3 states and 1271 transitions. [2024-11-16 23:45:13,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 388 transitions, 858 flow [2024-11-16 23:45:13,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 388 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:13,527 INFO L231 Difference]: Finished difference. Result has 383 places, 388 transitions, 796 flow [2024-11-16 23:45:13,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=383, PETRI_TRANSITIONS=388} [2024-11-16 23:45:13,529 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -67 predicate places. [2024-11-16 23:45:13,529 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 388 transitions, 796 flow [2024-11-16 23:45:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:13,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:13,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:13,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:45:13,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:13,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1574589805, now seen corresponding path program 1 times [2024-11-16 23:45:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:13,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781877807] [2024-11-16 23:45:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:13,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781877807] [2024-11-16 23:45:13,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781877807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:13,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:13,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498616024] [2024-11-16 23:45:13,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:13,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:13,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:13,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:13,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:13,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-16 23:45:13,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 388 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:13,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:13,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-16 23:45:13,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:14,150 INFO L124 PetriNetUnfolderBase]: 1245/3789 cut-off events. [2024-11-16 23:45:14,150 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:14,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5504 conditions, 3789 events. 1245/3789 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27848 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5450. Up to 1563 conditions per place. [2024-11-16 23:45:14,187 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2024-11-16 23:45:14,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 387 transitions, 856 flow [2024-11-16 23:45:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-16 23:45:14,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-16 23:45:14,191 INFO L175 Difference]: Start difference. First operand has 383 places, 388 transitions, 796 flow. Second operand 3 states and 1271 transitions. [2024-11-16 23:45:14,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 387 transitions, 856 flow [2024-11-16 23:45:14,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 387 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:14,198 INFO L231 Difference]: Finished difference. Result has 382 places, 387 transitions, 794 flow [2024-11-16 23:45:14,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=382, PETRI_TRANSITIONS=387} [2024-11-16 23:45:14,201 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -68 predicate places. [2024-11-16 23:45:14,201 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 387 transitions, 794 flow [2024-11-16 23:45:14,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:14,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:14,202 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:14,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:45:14,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1130373257, now seen corresponding path program 1 times [2024-11-16 23:45:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:14,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014711028] [2024-11-16 23:45:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:14,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:14,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:14,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:14,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014711028] [2024-11-16 23:45:14,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014711028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:14,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:14,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:14,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739674257] [2024-11-16 23:45:14,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:14,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:14,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-16 23:45:14,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 387 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:14,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:14,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-16 23:45:14,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:14,698 INFO L124 PetriNetUnfolderBase]: 1245/3788 cut-off events. [2024-11-16 23:45:14,699 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:14,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5503 conditions, 3788 events. 1245/3788 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27811 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5441. Up to 1563 conditions per place. [2024-11-16 23:45:14,722 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2024-11-16 23:45:14,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 386 transitions, 854 flow [2024-11-16 23:45:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-16 23:45:14,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-16 23:45:14,725 INFO L175 Difference]: Start difference. First operand has 382 places, 387 transitions, 794 flow. Second operand 3 states and 1271 transitions. [2024-11-16 23:45:14,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 386 transitions, 854 flow [2024-11-16 23:45:14,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 386 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:14,729 INFO L231 Difference]: Finished difference. Result has 381 places, 386 transitions, 792 flow [2024-11-16 23:45:14,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=381, PETRI_TRANSITIONS=386} [2024-11-16 23:45:14,730 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -69 predicate places. [2024-11-16 23:45:14,730 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 386 transitions, 792 flow [2024-11-16 23:45:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:14,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:14,731 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:45:14,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 242785853, now seen corresponding path program 1 times [2024-11-16 23:45:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724372451] [2024-11-16 23:45:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:14,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:14,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724372451] [2024-11-16 23:45:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724372451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958260371] [2024-11-16 23:45:14,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:14,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:14,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:14,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-16 23:45:14,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 386 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:14,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:14,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-16 23:45:14,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:15,224 INFO L124 PetriNetUnfolderBase]: 1245/3787 cut-off events. [2024-11-16 23:45:15,225 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:15,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5502 conditions, 3787 events. 1245/3787 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27742 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5432. Up to 1563 conditions per place. [2024-11-16 23:45:15,250 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-16 23:45:15,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 385 transitions, 852 flow [2024-11-16 23:45:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-16 23:45:15,252 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-16 23:45:15,252 INFO L175 Difference]: Start difference. First operand has 381 places, 386 transitions, 792 flow. Second operand 3 states and 1271 transitions. [2024-11-16 23:45:15,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 385 transitions, 852 flow [2024-11-16 23:45:15,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 385 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:15,257 INFO L231 Difference]: Finished difference. Result has 380 places, 385 transitions, 790 flow [2024-11-16 23:45:15,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=380, PETRI_TRANSITIONS=385} [2024-11-16 23:45:15,258 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -70 predicate places. [2024-11-16 23:45:15,258 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 385 transitions, 790 flow [2024-11-16 23:45:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:15,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:15,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:15,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:45:15,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash 512056188, now seen corresponding path program 1 times [2024-11-16 23:45:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77752294] [2024-11-16 23:45:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:15,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77752294] [2024-11-16 23:45:15,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77752294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:15,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:15,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:15,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700346339] [2024-11-16 23:45:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:15,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:15,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:15,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:15,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:15,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 527 [2024-11-16 23:45:15,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 385 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:15,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:15,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 527 [2024-11-16 23:45:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:15,788 INFO L124 PetriNetUnfolderBase]: 1245/3786 cut-off events. [2024-11-16 23:45:15,789 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:15,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5507 conditions, 3786 events. 1245/3786 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27788 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5429. Up to 1569 conditions per place. [2024-11-16 23:45:15,810 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 35 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-11-16 23:45:15,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 384 transitions, 862 flow [2024-11-16 23:45:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2024-11-16 23:45:15,812 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7963314358001266 [2024-11-16 23:45:15,812 INFO L175 Difference]: Start difference. First operand has 380 places, 385 transitions, 790 flow. Second operand 3 states and 1259 transitions. [2024-11-16 23:45:15,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 384 transitions, 862 flow [2024-11-16 23:45:15,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 384 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:15,816 INFO L231 Difference]: Finished difference. Result has 379 places, 384 transitions, 788 flow [2024-11-16 23:45:15,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=384} [2024-11-16 23:45:15,818 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -71 predicate places. [2024-11-16 23:45:15,818 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 384 transitions, 788 flow [2024-11-16 23:45:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:15,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:15,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:15,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:45:15,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:15,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:15,819 INFO L85 PathProgramCache]: Analyzing trace with hash 544105443, now seen corresponding path program 1 times [2024-11-16 23:45:15,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:15,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324512441] [2024-11-16 23:45:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:15,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324512441] [2024-11-16 23:45:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324512441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392900093] [2024-11-16 23:45:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:15,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:15,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-16 23:45:15,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 384 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:15,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:15,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-16 23:45:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:16,228 INFO L124 PetriNetUnfolderBase]: 1245/3785 cut-off events. [2024-11-16 23:45:16,229 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:16,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5501 conditions, 3785 events. 1245/3785 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27755 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5415. Up to 1564 conditions per place. [2024-11-16 23:45:16,253 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-11-16 23:45:16,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 383 transitions, 850 flow [2024-11-16 23:45:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-16 23:45:16,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-16 23:45:16,255 INFO L175 Difference]: Start difference. First operand has 379 places, 384 transitions, 788 flow. Second operand 3 states and 1269 transitions. [2024-11-16 23:45:16,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 383 transitions, 850 flow [2024-11-16 23:45:16,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 383 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:16,260 INFO L231 Difference]: Finished difference. Result has 378 places, 383 transitions, 786 flow [2024-11-16 23:45:16,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=383} [2024-11-16 23:45:16,261 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -72 predicate places. [2024-11-16 23:45:16,261 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 383 transitions, 786 flow [2024-11-16 23:45:16,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:16,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:16,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:16,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:45:16,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:16,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash -85905852, now seen corresponding path program 1 times [2024-11-16 23:45:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:16,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751104234] [2024-11-16 23:45:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751104234] [2024-11-16 23:45:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751104234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562404513] [2024-11-16 23:45:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:16,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:16,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-16 23:45:16,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 383 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:16,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:16,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-16 23:45:16,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:16,803 INFO L124 PetriNetUnfolderBase]: 1245/3784 cut-off events. [2024-11-16 23:45:16,803 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:16,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5500 conditions, 3784 events. 1245/3784 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27735 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5406. Up to 1564 conditions per place. [2024-11-16 23:45:16,829 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2024-11-16 23:45:16,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 382 transitions, 848 flow [2024-11-16 23:45:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-16 23:45:16,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-16 23:45:16,832 INFO L175 Difference]: Start difference. First operand has 378 places, 383 transitions, 786 flow. Second operand 3 states and 1269 transitions. [2024-11-16 23:45:16,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 382 transitions, 848 flow [2024-11-16 23:45:16,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:16,838 INFO L231 Difference]: Finished difference. Result has 377 places, 382 transitions, 784 flow [2024-11-16 23:45:16,838 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=377, PETRI_TRANSITIONS=382} [2024-11-16 23:45:16,839 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -73 predicate places. [2024-11-16 23:45:16,839 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 382 transitions, 784 flow [2024-11-16 23:45:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:16,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:16,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:16,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:45:16,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:16,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash -459527863, now seen corresponding path program 1 times [2024-11-16 23:45:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990747828] [2024-11-16 23:45:16,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:16,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990747828] [2024-11-16 23:45:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990747828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:16,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136105664] [2024-11-16 23:45:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:16,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:16,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-16 23:45:16,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:16,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:16,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-16 23:45:16,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:17,420 INFO L124 PetriNetUnfolderBase]: 1245/3783 cut-off events. [2024-11-16 23:45:17,421 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:17,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 3783 events. 1245/3783 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27766 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5397. Up to 1564 conditions per place. [2024-11-16 23:45:17,447 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2024-11-16 23:45:17,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 381 transitions, 846 flow [2024-11-16 23:45:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-16 23:45:17,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-16 23:45:17,450 INFO L175 Difference]: Start difference. First operand has 377 places, 382 transitions, 784 flow. Second operand 3 states and 1269 transitions. [2024-11-16 23:45:17,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 381 transitions, 846 flow [2024-11-16 23:45:17,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 381 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:17,455 INFO L231 Difference]: Finished difference. Result has 376 places, 381 transitions, 782 flow [2024-11-16 23:45:17,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=376, PETRI_TRANSITIONS=381} [2024-11-16 23:45:17,456 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -74 predicate places. [2024-11-16 23:45:17,456 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 381 transitions, 782 flow [2024-11-16 23:45:17,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:17,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:17,457 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:45:17,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 140500231, now seen corresponding path program 1 times [2024-11-16 23:45:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296451711] [2024-11-16 23:45:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:17,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296451711] [2024-11-16 23:45:17,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296451711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:17,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:17,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603600667] [2024-11-16 23:45:17,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:17,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:17,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:17,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:17,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 527 [2024-11-16 23:45:17,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:17,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:17,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 527 [2024-11-16 23:45:17,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:17,964 INFO L124 PetriNetUnfolderBase]: 1245/3782 cut-off events. [2024-11-16 23:45:17,965 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:17,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5498 conditions, 3782 events. 1245/3782 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27774 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5388. Up to 1564 conditions per place. [2024-11-16 23:45:17,988 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 30 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2024-11-16 23:45:17,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 380 transitions, 844 flow [2024-11-16 23:45:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2024-11-16 23:45:17,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026565464895635 [2024-11-16 23:45:17,991 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 782 flow. Second operand 3 states and 1269 transitions. [2024-11-16 23:45:17,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 380 transitions, 844 flow [2024-11-16 23:45:17,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:17,995 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 780 flow [2024-11-16 23:45:17,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2024-11-16 23:45:17,996 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -75 predicate places. [2024-11-16 23:45:17,997 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 780 flow [2024-11-16 23:45:17,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:17,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:17,998 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:17,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:45:17,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash 163570734, now seen corresponding path program 1 times [2024-11-16 23:45:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300329806] [2024-11-16 23:45:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300329806] [2024-11-16 23:45:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300329806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563565845] [2024-11-16 23:45:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:18,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 527 [2024-11-16 23:45:18,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:18,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:18,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 527 [2024-11-16 23:45:18,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:18,401 INFO L124 PetriNetUnfolderBase]: 1328/4039 cut-off events. [2024-11-16 23:45:18,401 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2024-11-16 23:45:18,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5882 conditions, 4039 events. 1328/4039 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 30382 event pairs, 536 based on Foata normal form. 0/3303 useless extension candidates. Maximal degree in co-relation 5764. Up to 1683 conditions per place. [2024-11-16 23:45:18,425 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 33 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-11-16 23:45:18,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 848 flow [2024-11-16 23:45:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2024-11-16 23:45:18,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7950664136622391 [2024-11-16 23:45:18,428 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 780 flow. Second operand 3 states and 1257 transitions. [2024-11-16 23:45:18,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 848 flow [2024-11-16 23:45:18,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:18,432 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 778 flow [2024-11-16 23:45:18,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2024-11-16 23:45:18,433 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -76 predicate places. [2024-11-16 23:45:18,433 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 778 flow [2024-11-16 23:45:18,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:18,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:18,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:45:18,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:18,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1536988029, now seen corresponding path program 1 times [2024-11-16 23:45:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209584046] [2024-11-16 23:45:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209584046] [2024-11-16 23:45:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209584046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059781647] [2024-11-16 23:45:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:18,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 527 [2024-11-16 23:45:18,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:18,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:18,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 527 [2024-11-16 23:45:18,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:18,891 INFO L124 PetriNetUnfolderBase]: 1432/4326 cut-off events. [2024-11-16 23:45:18,891 INFO L125 PetriNetUnfolderBase]: For 326/326 co-relation queries the response was YES. [2024-11-16 23:45:18,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6326 conditions, 4326 events. 1432/4326 cut-off events. For 326/326 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 33001 event pairs, 600 based on Foata normal form. 0/3548 useless extension candidates. Maximal degree in co-relation 6200. Up to 1830 conditions per place. [2024-11-16 23:45:18,915 INFO L140 encePairwiseOnDemand]: 522/527 looper letters, 34 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2024-11-16 23:45:18,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 375 transitions, 840 flow [2024-11-16 23:45:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-16 23:45:18,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7855787476280834 [2024-11-16 23:45:18,918 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 778 flow. Second operand 3 states and 1242 transitions. [2024-11-16 23:45:18,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 375 transitions, 840 flow [2024-11-16 23:45:18,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 375 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:18,922 INFO L231 Difference]: Finished difference. Result has 370 places, 375 transitions, 768 flow [2024-11-16 23:45:18,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=370, PETRI_TRANSITIONS=375} [2024-11-16 23:45:18,923 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -80 predicate places. [2024-11-16 23:45:18,923 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 375 transitions, 768 flow [2024-11-16 23:45:18,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:18,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:18,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:18,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:45:18,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:18,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1979995823, now seen corresponding path program 1 times [2024-11-16 23:45:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025101669] [2024-11-16 23:45:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025101669] [2024-11-16 23:45:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025101669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333181341] [2024-11-16 23:45:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:19,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:19,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 527 [2024-11-16 23:45:19,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 375 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:19,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:19,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 527 [2024-11-16 23:45:19,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:19,758 INFO L124 PetriNetUnfolderBase]: 1245/3769 cut-off events. [2024-11-16 23:45:19,758 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:19,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5491 conditions, 3769 events. 1245/3769 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27606 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5366. Up to 1568 conditions per place. [2024-11-16 23:45:19,779 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 34 selfloop transitions, 5 changer transitions 0/374 dead transitions. [2024-11-16 23:45:19,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 374 transitions, 844 flow [2024-11-16 23:45:19,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2024-11-16 23:45:19,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7830487033523087 [2024-11-16 23:45:19,783 INFO L175 Difference]: Start difference. First operand has 370 places, 375 transitions, 768 flow. Second operand 6 states and 2476 transitions. [2024-11-16 23:45:19,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 374 transitions, 844 flow [2024-11-16 23:45:19,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 374 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:45:19,787 INFO L231 Difference]: Finished difference. Result has 373 places, 374 transitions, 775 flow [2024-11-16 23:45:19,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=775, PETRI_PLACES=373, PETRI_TRANSITIONS=374} [2024-11-16 23:45:19,788 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -77 predicate places. [2024-11-16 23:45:19,788 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 374 transitions, 775 flow [2024-11-16 23:45:19,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:19,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:19,789 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:19,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:45:19,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:19,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash 365119816, now seen corresponding path program 1 times [2024-11-16 23:45:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25166422] [2024-11-16 23:45:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:19,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25166422] [2024-11-16 23:45:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25166422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029223194] [2024-11-16 23:45:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:19,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 527 [2024-11-16 23:45:19,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 374 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:19,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:19,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 527 [2024-11-16 23:45:19,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:20,166 INFO L124 PetriNetUnfolderBase]: 1245/3768 cut-off events. [2024-11-16 23:45:20,167 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2024-11-16 23:45:20,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5487 conditions, 3768 events. 1245/3768 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 27653 event pairs, 493 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 5469. Up to 1563 conditions per place. [2024-11-16 23:45:20,190 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 29 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-11-16 23:45:20,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 373 transitions, 835 flow [2024-11-16 23:45:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1271 transitions. [2024-11-16 23:45:20,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803921568627451 [2024-11-16 23:45:20,193 INFO L175 Difference]: Start difference. First operand has 373 places, 374 transitions, 775 flow. Second operand 3 states and 1271 transitions. [2024-11-16 23:45:20,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 373 transitions, 835 flow [2024-11-16 23:45:20,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 373 transitions, 825 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:45:20,197 INFO L231 Difference]: Finished difference. Result has 369 places, 373 transitions, 767 flow [2024-11-16 23:45:20,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=369, PETRI_TRANSITIONS=373} [2024-11-16 23:45:20,198 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2024-11-16 23:45:20,198 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 373 transitions, 767 flow [2024-11-16 23:45:20,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:20,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:20,199 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:20,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:45:20,199 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:20,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2022962763, now seen corresponding path program 1 times [2024-11-16 23:45:20,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:20,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148334171] [2024-11-16 23:45:20,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148334171] [2024-11-16 23:45:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148334171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:20,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:20,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140736972] [2024-11-16 23:45:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:20,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 527 [2024-11-16 23:45:20,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 373 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:20,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:20,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 527 [2024-11-16 23:45:20,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:20,829 INFO L124 PetriNetUnfolderBase]: 1780/4956 cut-off events. [2024-11-16 23:45:20,829 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-16 23:45:20,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7433 conditions, 4956 events. 1780/4956 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 38790 event pairs, 383 based on Foata normal form. 0/4110 useless extension candidates. Maximal degree in co-relation 7307. Up to 1167 conditions per place. [2024-11-16 23:45:20,865 INFO L140 encePairwiseOnDemand]: 518/527 looper letters, 58 selfloop transitions, 3 changer transitions 0/389 dead transitions. [2024-11-16 23:45:20,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 389 transitions, 933 flow [2024-11-16 23:45:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-16 23:45:20,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8032890575585073 [2024-11-16 23:45:20,868 INFO L175 Difference]: Start difference. First operand has 369 places, 373 transitions, 767 flow. Second operand 3 states and 1270 transitions. [2024-11-16 23:45:20,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 389 transitions, 933 flow [2024-11-16 23:45:20,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 389 transitions, 929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:20,875 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 771 flow [2024-11-16 23:45:20,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2024-11-16 23:45:20,876 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -85 predicate places. [2024-11-16 23:45:20,876 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 771 flow [2024-11-16 23:45:20,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:20,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:20,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:20,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:45:20,877 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:20,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1553012456, now seen corresponding path program 1 times [2024-11-16 23:45:20,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:20,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037694630] [2024-11-16 23:45:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:20,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037694630] [2024-11-16 23:45:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037694630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:20,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:20,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596555003] [2024-11-16 23:45:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:20,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:20,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-16 23:45:20,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:20,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:20,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-16 23:45:20,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:21,637 INFO L124 PetriNetUnfolderBase]: 2303/6564 cut-off events. [2024-11-16 23:45:21,638 INFO L125 PetriNetUnfolderBase]: For 968/968 co-relation queries the response was YES. [2024-11-16 23:45:21,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10135 conditions, 6564 events. 2303/6564 cut-off events. For 968/968 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 56389 event pairs, 579 based on Foata normal form. 0/5496 useless extension candidates. Maximal degree in co-relation 10008. Up to 1571 conditions per place. [2024-11-16 23:45:21,689 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 50 selfloop transitions, 4 changer transitions 0/391 dead transitions. [2024-11-16 23:45:21,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 391 transitions, 946 flow [2024-11-16 23:45:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2024-11-16 23:45:21,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8216318785578748 [2024-11-16 23:45:21,691 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 771 flow. Second operand 3 states and 1299 transitions. [2024-11-16 23:45:21,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 391 transitions, 946 flow [2024-11-16 23:45:21,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 391 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:21,696 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 795 flow [2024-11-16 23:45:21,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2024-11-16 23:45:21,697 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -84 predicate places. [2024-11-16 23:45:21,697 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 795 flow [2024-11-16 23:45:21,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:21,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:21,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:21,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:45:21,698 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash -396967900, now seen corresponding path program 1 times [2024-11-16 23:45:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116096808] [2024-11-16 23:45:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:21,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116096808] [2024-11-16 23:45:21,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116096808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:21,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:21,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:21,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343983635] [2024-11-16 23:45:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:21,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:21,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 527 [2024-11-16 23:45:21,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:21,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:21,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 527 [2024-11-16 23:45:21,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:22,924 INFO L124 PetriNetUnfolderBase]: 3924/11032 cut-off events. [2024-11-16 23:45:22,924 INFO L125 PetriNetUnfolderBase]: For 2226/2226 co-relation queries the response was YES. [2024-11-16 23:45:22,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17702 conditions, 11032 events. 3924/11032 cut-off events. For 2226/2226 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 106461 event pairs, 1855 based on Foata normal form. 0/9200 useless extension candidates. Maximal degree in co-relation 17575. Up to 2935 conditions per place. [2024-11-16 23:45:22,994 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 60 selfloop transitions, 3 changer transitions 0/400 dead transitions. [2024-11-16 23:45:22,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 400 transitions, 1024 flow [2024-11-16 23:45:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2024-11-16 23:45:22,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.825426944971537 [2024-11-16 23:45:22,997 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 795 flow. Second operand 3 states and 1305 transitions. [2024-11-16 23:45:22,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 400 transitions, 1024 flow [2024-11-16 23:45:22,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 400 transitions, 1010 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:23,002 INFO L231 Difference]: Finished difference. Result has 367 places, 372 transitions, 805 flow [2024-11-16 23:45:23,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=367, PETRI_TRANSITIONS=372} [2024-11-16 23:45:23,003 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2024-11-16 23:45:23,003 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 372 transitions, 805 flow [2024-11-16 23:45:23,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.6666666666667) internal successors, (1253), 3 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:23,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:23,004 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:23,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:45:23,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:23,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1893193801, now seen corresponding path program 1 times [2024-11-16 23:45:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514644228] [2024-11-16 23:45:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:23,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514644228] [2024-11-16 23:45:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514644228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551032490] [2024-11-16 23:45:23,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:23,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:23,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-16 23:45:23,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 372 transitions, 805 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:23,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:23,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-16 23:45:23,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:25,523 INFO L124 PetriNetUnfolderBase]: 6937/19142 cut-off events. [2024-11-16 23:45:25,524 INFO L125 PetriNetUnfolderBase]: For 4021/4021 co-relation queries the response was YES. [2024-11-16 23:45:25,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31505 conditions, 19142 events. 6937/19142 cut-off events. For 4021/4021 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 204047 event pairs, 3342 based on Foata normal form. 0/16040 useless extension candidates. Maximal degree in co-relation 31376. Up to 5105 conditions per place. [2024-11-16 23:45:25,645 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 64 selfloop transitions, 4 changer transitions 0/403 dead transitions. [2024-11-16 23:45:25,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 403 transitions, 1054 flow [2024-11-16 23:45:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2024-11-16 23:45:25,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8241619228336496 [2024-11-16 23:45:25,648 INFO L175 Difference]: Start difference. First operand has 367 places, 372 transitions, 805 flow. Second operand 3 states and 1303 transitions. [2024-11-16 23:45:25,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 403 transitions, 1054 flow [2024-11-16 23:45:25,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 403 transitions, 1044 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:25,655 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 829 flow [2024-11-16 23:45:25,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=829, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2024-11-16 23:45:25,656 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -82 predicate places. [2024-11-16 23:45:25,656 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 829 flow [2024-11-16 23:45:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:25,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:25,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:25,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:45:25,657 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:25,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1380849805, now seen corresponding path program 1 times [2024-11-16 23:45:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020360772] [2024-11-16 23:45:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:25,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:25,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020360772] [2024-11-16 23:45:25,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020360772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:25,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:25,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:25,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825370320] [2024-11-16 23:45:25,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:25,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:25,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-16 23:45:25,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 829 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:25,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:25,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-16 23:45:25,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:29,115 INFO L124 PetriNetUnfolderBase]: 9063/22322 cut-off events. [2024-11-16 23:45:29,116 INFO L125 PetriNetUnfolderBase]: For 5588/5588 co-relation queries the response was YES. [2024-11-16 23:45:29,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39223 conditions, 22322 events. 9063/22322 cut-off events. For 5588/5588 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 229502 event pairs, 1244 based on Foata normal form. 0/19160 useless extension candidates. Maximal degree in co-relation 39093. Up to 10869 conditions per place. [2024-11-16 23:45:29,286 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 64 selfloop transitions, 4 changer transitions 0/399 dead transitions. [2024-11-16 23:45:29,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 399 transitions, 1059 flow [2024-11-16 23:45:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:29,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2024-11-16 23:45:29,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8127767235926628 [2024-11-16 23:45:29,289 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 829 flow. Second operand 3 states and 1285 transitions. [2024-11-16 23:45:29,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 399 transitions, 1059 flow [2024-11-16 23:45:29,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 399 transitions, 1045 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:29,299 INFO L231 Difference]: Finished difference. Result has 367 places, 375 transitions, 841 flow [2024-11-16 23:45:29,300 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=841, PETRI_PLACES=367, PETRI_TRANSITIONS=375} [2024-11-16 23:45:29,300 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -83 predicate places. [2024-11-16 23:45:29,300 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 375 transitions, 841 flow [2024-11-16 23:45:29,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:29,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:29,301 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:29,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:45:29,301 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:29,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1692897774, now seen corresponding path program 1 times [2024-11-16 23:45:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:29,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674885799] [2024-11-16 23:45:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674885799] [2024-11-16 23:45:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674885799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577625910] [2024-11-16 23:45:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:29,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:29,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:29,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:29,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 527 [2024-11-16 23:45:29,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 375 transitions, 841 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:29,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:29,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 527 [2024-11-16 23:45:29,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:33,990 INFO L124 PetriNetUnfolderBase]: 11737/30512 cut-off events. [2024-11-16 23:45:33,990 INFO L125 PetriNetUnfolderBase]: For 7741/7741 co-relation queries the response was YES. [2024-11-16 23:45:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54535 conditions, 30512 events. 11737/30512 cut-off events. For 7741/7741 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 334722 event pairs, 2352 based on Foata normal form. 0/26197 useless extension candidates. Maximal degree in co-relation 54405. Up to 12037 conditions per place. [2024-11-16 23:45:34,275 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 69 selfloop transitions, 4 changer transitions 0/403 dead transitions. [2024-11-16 23:45:34,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 403 transitions, 1092 flow [2024-11-16 23:45:34,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2024-11-16 23:45:34,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8134092346616065 [2024-11-16 23:45:34,278 INFO L175 Difference]: Start difference. First operand has 367 places, 375 transitions, 841 flow. Second operand 3 states and 1286 transitions. [2024-11-16 23:45:34,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 403 transitions, 1092 flow [2024-11-16 23:45:34,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 403 transitions, 1092 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:45:34,286 INFO L231 Difference]: Finished difference. Result has 368 places, 376 transitions, 861 flow [2024-11-16 23:45:34,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=368, PETRI_TRANSITIONS=376} [2024-11-16 23:45:34,287 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -82 predicate places. [2024-11-16 23:45:34,287 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 376 transitions, 861 flow [2024-11-16 23:45:34,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:34,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:34,288 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:34,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 23:45:34,288 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:34,289 INFO L85 PathProgramCache]: Analyzing trace with hash -208521977, now seen corresponding path program 1 times [2024-11-16 23:45:34,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547664780] [2024-11-16 23:45:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:34,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547664780] [2024-11-16 23:45:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547664780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:34,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:34,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:34,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421431005] [2024-11-16 23:45:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:34,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:34,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:34,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:34,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-16 23:45:34,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 376 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:34,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:34,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-16 23:45:34,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:38,787 INFO L124 PetriNetUnfolderBase]: 10771/30709 cut-off events. [2024-11-16 23:45:38,788 INFO L125 PetriNetUnfolderBase]: For 9560/9560 co-relation queries the response was YES. [2024-11-16 23:45:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55746 conditions, 30709 events. 10771/30709 cut-off events. For 9560/9560 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 355195 event pairs, 4412 based on Foata normal form. 0/26184 useless extension candidates. Maximal degree in co-relation 55615. Up to 13869 conditions per place. [2024-11-16 23:45:39,025 INFO L140 encePairwiseOnDemand]: 525/527 looper letters, 42 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2024-11-16 23:45:39,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 375 transitions, 945 flow [2024-11-16 23:45:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1278 transitions. [2024-11-16 23:45:39,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8083491461100569 [2024-11-16 23:45:39,029 INFO L175 Difference]: Start difference. First operand has 368 places, 376 transitions, 861 flow. Second operand 3 states and 1278 transitions. [2024-11-16 23:45:39,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 375 transitions, 945 flow [2024-11-16 23:45:39,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 945 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:45:39,042 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 861 flow [2024-11-16 23:45:39,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2024-11-16 23:45:39,043 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2024-11-16 23:45:39,043 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 861 flow [2024-11-16 23:45:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:39,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:39,043 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:39,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:45:39,044 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2024-11-16 23:45:39,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:39,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1798532750, now seen corresponding path program 1 times [2024-11-16 23:45:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:39,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560301052] [2024-11-16 23:45:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:45:39,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:39,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560301052] [2024-11-16 23:45:39,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560301052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:39,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:39,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:39,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139146044] [2024-11-16 23:45:39,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:39,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:39,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:39,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 527 [2024-11-16 23:45:39,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:39,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:39,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 527 [2024-11-16 23:45:39,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:43,323 INFO L124 PetriNetUnfolderBase]: 10771/30708 cut-off events. [2024-11-16 23:45:43,324 INFO L125 PetriNetUnfolderBase]: For 9560/9560 co-relation queries the response was YES. [2024-11-16 23:45:43,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55746 conditions, 30708 events. 10771/30708 cut-off events. For 9560/9560 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 355414 event pairs, 4412 based on Foata normal form. 1/26184 useless extension candidates. Maximal degree in co-relation 55732. Up to 13869 conditions per place. [2024-11-16 23:45:43,429 INFO L140 encePairwiseOnDemand]: 525/527 looper letters, 0 selfloop transitions, 0 changer transitions 374/374 dead transitions. [2024-11-16 23:45:43,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 943 flow [2024-11-16 23:45:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1277 transitions. [2024-11-16 23:45:43,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8077166350411132 [2024-11-16 23:45:43,431 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 861 flow. Second operand 3 states and 1277 transitions. [2024-11-16 23:45:43,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 943 flow [2024-11-16 23:45:43,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 374 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:45:43,439 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-11-16 23:45:43,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-11-16 23:45:43,439 INFO L277 CegarLoopForPetriNet]: 450 programPoint places, -81 predicate places. [2024-11-16 23:45:43,439 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-11-16 23:45:43,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:45:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 147 remaining) [2024-11-16 23:45:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (145 of 147 remaining) [2024-11-16 23:45:43,442 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (144 of 147 remaining) [2024-11-16 23:45:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (143 of 147 remaining) [2024-11-16 23:45:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (142 of 147 remaining) [2024-11-16 23:45:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (141 of 147 remaining) [2024-11-16 23:45:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (140 of 147 remaining) [2024-11-16 23:45:43,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (139 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (137 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (136 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (135 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (133 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (132 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (131 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (130 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (129 of 147 remaining) [2024-11-16 23:45:43,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (126 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (124 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (123 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (122 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (121 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (120 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (119 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (118 of 147 remaining) [2024-11-16 23:45:43,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (117 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (116 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (115 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (114 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (113 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (112 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (111 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (108 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (107 of 147 remaining) [2024-11-16 23:45:43,446 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (104 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (103 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (102 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (101 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (100 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (99 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (98 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (97 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (96 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (95 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (94 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (93 of 147 remaining) [2024-11-16 23:45:43,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (92 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (91 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (90 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (89 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (86 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (85 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (84 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (83 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (82 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (79 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (78 of 147 remaining) [2024-11-16 23:45:43,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (77 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (75 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (74 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (73 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (72 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (71 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (70 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (69 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (68 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (67 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (66 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (65 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (62 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (61 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (60 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (59 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (58 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (57 of 147 remaining) [2024-11-16 23:45:43,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (39 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (38 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (37 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (36 of 147 remaining) [2024-11-16 23:45:43,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (35 of 147 remaining) [2024-11-16 23:45:43,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 147 remaining) [2024-11-16 23:45:43,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 147 remaining) [2024-11-16 23:45:43,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 147 remaining) [2024-11-16 23:45:43,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (31 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (30 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (29 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (28 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (27 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (26 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (25 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (21 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (20 of 147 remaining) [2024-11-16 23:45:43,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (19 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (18 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (15 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (14 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (13 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (12 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (11 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (10 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (9 of 147 remaining) [2024-11-16 23:45:43,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (8 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (7 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (6 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 147 remaining) [2024-11-16 23:45:43,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 147 remaining) [2024-11-16 23:45:43,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:45:43,454 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:45:43,459 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:45:43,459 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:45:43,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:45:43 BasicIcfg [2024-11-16 23:45:43,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:45:43,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:45:43,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:45:43,463 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:45:43,464 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:45:10" (3/4) ... [2024-11-16 23:45:43,465 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:45:43,467 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:45:43,467 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:45:43,467 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-16 23:45:43,467 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-16 23:45:43,467 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-16 23:45:43,467 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-16 23:45:43,472 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-16 23:45:43,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:45:43,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:45:43,473 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:45:43,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:45:43,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:45:43,553 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:45:43,554 INFO L158 Benchmark]: Toolchain (without parser) took 34413.50ms. Allocated memory was 247.5MB in the beginning and 13.5GB in the end (delta: 13.3GB). Free memory was 219.7MB in the beginning and 11.7GB in the end (delta: -11.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-16 23:45:43,554 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:45:43,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.34ms. Allocated memory is still 247.5MB. Free memory was 219.7MB in the beginning and 204.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 23:45:43,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.13ms. Allocated memory is still 247.5MB. Free memory was 204.0MB in the beginning and 199.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:45:43,554 INFO L158 Benchmark]: Boogie Preprocessor took 43.05ms. Allocated memory is still 247.5MB. Free memory was 199.8MB in the beginning and 196.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:45:43,555 INFO L158 Benchmark]: IcfgBuilder took 1194.61ms. Allocated memory is still 247.5MB. Free memory was 196.6MB in the beginning and 199.3MB in the end (delta: -2.7MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-11-16 23:45:43,555 INFO L158 Benchmark]: TraceAbstraction took 32741.47ms. Allocated memory was 247.5MB in the beginning and 13.5GB in the end (delta: 13.3GB). Free memory was 197.9MB in the beginning and 11.7GB in the end (delta: -11.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-16 23:45:43,555 INFO L158 Benchmark]: Witness Printer took 90.01ms. Allocated memory is still 13.5GB. Free memory was 11.7GB in the beginning and 11.7GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 23:45:43,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.34ms. Allocated memory is still 247.5MB. Free memory was 219.7MB in the beginning and 204.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.13ms. Allocated memory is still 247.5MB. Free memory was 204.0MB in the beginning and 199.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.05ms. Allocated memory is still 247.5MB. Free memory was 199.8MB in the beginning and 196.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1194.61ms. Allocated memory is still 247.5MB. Free memory was 196.6MB in the beginning and 199.3MB in the end (delta: -2.7MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32741.47ms. Allocated memory was 247.5MB in the beginning and 13.5GB in the end (delta: 13.3GB). Free memory was 197.9MB in the beginning and 11.7GB in the end (delta: -11.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 90.01ms. Allocated memory is still 13.5GB. Free memory was 11.7GB in the beginning and 11.7GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 626 locations, 147 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.5s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 69 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2954 NumberOfCodeBlocks, 2954 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2931 ConstructedInterpolants, 0 QuantifiedInterpolants, 3090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 23:45:43,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE