./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-mts.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/popl20-more-mts.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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:46:26,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:46:26,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:46:26,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:46:26,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:46:26,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:46:26,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:46:26,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:46:26,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:46:26,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:46:26,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:46:26,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:46:26,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:46:26,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:46:26,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:46:26,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:46:26,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:46:26,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:46:26,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:46:26,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:46:26,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:46:26,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:46:26,110 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:46:26,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:46:26,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:46:26,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:46:26,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:46:26,110 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:46:26,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:46:26,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:46:26,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:46:26,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:26,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:46:26,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:46:26,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:46:26,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:46:26,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:46:26,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:46:26,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:46:26,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:46:26,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:46:26,113 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-11-16 23:46:26,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:46:26,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:46:26,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:46:26,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:46:26,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:46:26,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-16 23:46:27,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:46:27,735 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:46:27,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-16 23:46:27,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef5bd128/faa60813efb544ed9dbf6142dec46009/FLAGf1611e8e8 [2024-11-16 23:46:27,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fef5bd128/faa60813efb544ed9dbf6142dec46009 [2024-11-16 23:46:27,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:46:27,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:46:27,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:27,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:46:27,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:46:27,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:27" (1/1) ... [2024-11-16 23:46:27,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b9c244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:27, skipping insertion in model container [2024-11-16 23:46:27,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:27" (1/1) ... [2024-11-16 23:46:27,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:46:28,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:28,060 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:46:28,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:28,098 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:46:28,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28 WrapperNode [2024-11-16 23:46:28,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:28,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:28,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:46:28,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:46:28,104 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:46:28" (1/1) ... [2024-11-16 23:46:28,112 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:46:28" (1/1) ... [2024-11-16 23:46:28,137 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 350 [2024-11-16 23:46:28,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:28,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:46:28,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:46:28,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:46:28,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:46:28,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:46:28,176 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:46:28,176 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:46:28,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (1/1) ... [2024-11-16 23:46:28,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:28,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:46:28,209 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:46:28,212 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:46:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:46:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:46:28,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:46:28,252 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:46:28,253 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:46:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:46:28,253 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:46:28,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:46:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:46:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 23:46:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 23:46:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:46:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:46:28,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:46:28,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:46:28,256 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:46:28,376 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:46:28,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:46:28,825 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:46:28,825 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:46:28,992 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:46:28,992 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:46:28,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:28 BoogieIcfgContainer [2024-11-16 23:46:28,993 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:46:28,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:46:28,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:46:29,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:46:29,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:46:27" (1/3) ... [2024-11-16 23:46:29,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530d757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:29, skipping insertion in model container [2024-11-16 23:46:29,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:28" (2/3) ... [2024-11-16 23:46:29,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6530d757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:29, skipping insertion in model container [2024-11-16 23:46:29,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:28" (3/3) ... [2024-11-16 23:46:29,027 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-11-16 23:46:29,043 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:46:29,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-16 23:46:29,044 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:46:29,143 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:46:29,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 361 places, 371 transitions, 763 flow [2024-11-16 23:46:29,289 INFO L124 PetriNetUnfolderBase]: 20/368 cut-off events. [2024-11-16 23:46:29,291 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:46:29,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 368 events. 20/368 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 888 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 295. Up to 2 conditions per place. [2024-11-16 23:46:29,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 371 transitions, 763 flow [2024-11-16 23:46:29,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 347 transitions, 712 flow [2024-11-16 23:46:29,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:46:29,324 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;@270fbab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:46:29,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-11-16 23:46:29,327 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:46:29,328 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-16 23:46:29,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:46:29,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:29,328 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] [2024-11-16 23:46:29,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:29,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash -3274308, now seen corresponding path program 1 times [2024-11-16 23:46:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:29,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110600869] [2024-11-16 23:46:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:29,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:29,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:46:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110600869] [2024-11-16 23:46:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110600869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:29,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949610902] [2024-11-16 23:46:29,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:29,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 371 [2024-11-16 23:46:29,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 347 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:46:29,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:29,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 371 [2024-11-16 23:46:29,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:29,701 INFO L124 PetriNetUnfolderBase]: 32/690 cut-off events. [2024-11-16 23:46:29,702 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-16 23:46:29,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 690 events. 32/690 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3091 event pairs, 12 based on Foata normal form. 30/612 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-11-16 23:46:29,713 INFO L140 encePairwiseOnDemand]: 346/371 looper letters, 14 selfloop transitions, 2 changer transitions 3/324 dead transitions. [2024-11-16 23:46:29,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 324 transitions, 698 flow [2024-11-16 23:46:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1026 transitions. [2024-11-16 23:46:29,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.921832884097035 [2024-11-16 23:46:29,734 INFO L175 Difference]: Start difference. First operand has 339 places, 347 transitions, 712 flow. Second operand 3 states and 1026 transitions. [2024-11-16 23:46:29,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 324 transitions, 698 flow [2024-11-16 23:46:29,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 324 transitions, 686 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:46:29,744 INFO L231 Difference]: Finished difference. Result has 323 places, 321 transitions, 652 flow [2024-11-16 23:46:29,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=323, PETRI_TRANSITIONS=321} [2024-11-16 23:46:29,749 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -16 predicate places. [2024-11-16 23:46:29,750 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 321 transitions, 652 flow [2024-11-16 23:46:29,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:46:29,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:29,751 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] [2024-11-16 23:46:29,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:46:29,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:29,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -777532505, now seen corresponding path program 1 times [2024-11-16 23:46:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680810598] [2024-11-16 23:46:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:29,799 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:46:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680810598] [2024-11-16 23:46:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680810598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:29,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:29,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420790424] [2024-11-16 23:46:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:29,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 371 [2024-11-16 23:46:29,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 321 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:46:29,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:29,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 371 [2024-11-16 23:46:29,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:29,930 INFO L124 PetriNetUnfolderBase]: 23/636 cut-off events. [2024-11-16 23:46:29,931 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:46:29,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 636 events. 23/636 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2780 event pairs, 8 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 650. Up to 35 conditions per place. [2024-11-16 23:46:29,938 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 14 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2024-11-16 23:46:29,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 320 transitions, 682 flow [2024-11-16 23:46:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2024-11-16 23:46:29,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020664869721473 [2024-11-16 23:46:29,942 INFO L175 Difference]: Start difference. First operand has 323 places, 321 transitions, 652 flow. Second operand 3 states and 1004 transitions. [2024-11-16 23:46:29,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 320 transitions, 682 flow [2024-11-16 23:46:29,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 320 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:29,947 INFO L231 Difference]: Finished difference. Result has 319 places, 320 transitions, 650 flow [2024-11-16 23:46:29,948 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=319, PETRI_TRANSITIONS=320} [2024-11-16 23:46:29,948 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -20 predicate places. [2024-11-16 23:46:29,948 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 320 transitions, 650 flow [2024-11-16 23:46:29,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:46:29,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:29,950 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] [2024-11-16 23:46:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:46:29,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash -582630675, now seen corresponding path program 1 times [2024-11-16 23:46:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:29,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821608712] [2024-11-16 23:46:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:29,993 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:46:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:29,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821608712] [2024-11-16 23:46:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821608712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:29,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560779811] [2024-11-16 23:46:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:29,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:29,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:29,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:30,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 371 [2024-11-16 23:46:30,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 320 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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:46:30,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:30,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 371 [2024-11-16 23:46:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:30,105 INFO L124 PetriNetUnfolderBase]: 35/597 cut-off events. [2024-11-16 23:46:30,105 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 23:46:30,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 597 events. 35/597 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2522 event pairs, 16 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 626. Up to 56 conditions per place. [2024-11-16 23:46:30,110 INFO L140 encePairwiseOnDemand]: 366/371 looper letters, 15 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2024-11-16 23:46:30,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 316 transitions, 674 flow [2024-11-16 23:46:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-11-16 23:46:30,113 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.89937106918239 [2024-11-16 23:46:30,113 INFO L175 Difference]: Start difference. First operand has 319 places, 320 transitions, 650 flow. Second operand 3 states and 1001 transitions. [2024-11-16 23:46:30,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 316 transitions, 674 flow [2024-11-16 23:46:30,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 316 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:30,116 INFO L231 Difference]: Finished difference. Result has 315 places, 316 transitions, 640 flow [2024-11-16 23:46:30,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=315, PETRI_TRANSITIONS=316} [2024-11-16 23:46:30,118 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -24 predicate places. [2024-11-16 23:46:30,118 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 316 transitions, 640 flow [2024-11-16 23:46:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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:46:30,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:30,119 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] [2024-11-16 23:46:30,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:46:30,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 555346058, now seen corresponding path program 1 times [2024-11-16 23:46:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012258707] [2024-11-16 23:46:30,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:30,574 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:46:30,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012258707] [2024-11-16 23:46:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012258707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:30,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034717528] [2024-11-16 23:46:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:30,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:30,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:30,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 371 [2024-11-16 23:46:30,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 316 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 311.5) internal successors, (1869), 6 states have internal predecessors, (1869), 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:46:30,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:30,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 371 [2024-11-16 23:46:30,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:31,141 INFO L124 PetriNetUnfolderBase]: 541/3452 cut-off events. [2024-11-16 23:46:31,141 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-16 23:46:31,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 3452 events. 541/3452 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28502 event pairs, 386 based on Foata normal form. 0/2890 useless extension candidates. Maximal degree in co-relation 4298. Up to 786 conditions per place. [2024-11-16 23:46:31,166 INFO L140 encePairwiseOnDemand]: 365/371 looper letters, 31 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2024-11-16 23:46:31,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 710 flow [2024-11-16 23:46:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1897 transitions. [2024-11-16 23:46:31,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8522012578616353 [2024-11-16 23:46:31,170 INFO L175 Difference]: Start difference. First operand has 315 places, 316 transitions, 640 flow. Second operand 6 states and 1897 transitions. [2024-11-16 23:46:31,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 710 flow [2024-11-16 23:46:31,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 315 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:31,174 INFO L231 Difference]: Finished difference. Result has 318 places, 315 transitions, 647 flow [2024-11-16 23:46:31,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=318, PETRI_TRANSITIONS=315} [2024-11-16 23:46:31,175 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -21 predicate places. [2024-11-16 23:46:31,177 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 315 transitions, 647 flow [2024-11-16 23:46:31,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.5) internal successors, (1869), 6 states have internal predecessors, (1869), 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:46:31,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:31,178 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] [2024-11-16 23:46:31,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:46:31,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:31,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash -742849377, now seen corresponding path program 1 times [2024-11-16 23:46:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90269591] [2024-11-16 23:46:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:31,223 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:46:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90269591] [2024-11-16 23:46:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90269591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:31,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:31,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:31,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476422787] [2024-11-16 23:46:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:31,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:31,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:31,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 371 [2024-11-16 23:46:31,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 315 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:46:31,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:31,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 371 [2024-11-16 23:46:31,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:31,346 INFO L124 PetriNetUnfolderBase]: 57/676 cut-off events. [2024-11-16 23:46:31,346 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:46:31,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 676 events. 57/676 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3251 event pairs, 38 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 762. Up to 81 conditions per place. [2024-11-16 23:46:31,352 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 14 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2024-11-16 23:46:31,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 677 flow [2024-11-16 23:46:31,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2024-11-16 23:46:31,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020664869721473 [2024-11-16 23:46:31,355 INFO L175 Difference]: Start difference. First operand has 318 places, 315 transitions, 647 flow. Second operand 3 states and 1004 transitions. [2024-11-16 23:46:31,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 677 flow [2024-11-16 23:46:31,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 667 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:31,359 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 639 flow [2024-11-16 23:46:31,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2024-11-16 23:46:31,361 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -25 predicate places. [2024-11-16 23:46:31,362 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 639 flow [2024-11-16 23:46:31,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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:46:31,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:31,363 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] [2024-11-16 23:46:31,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:46:31,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:31,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1845708872, now seen corresponding path program 1 times [2024-11-16 23:46:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:31,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36019206] [2024-11-16 23:46:31,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:31,401 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:46:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36019206] [2024-11-16 23:46:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36019206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:31,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:31,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160446827] [2024-11-16 23:46:31,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:31,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:31,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:31,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 371 [2024-11-16 23:46:31,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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:46:31,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:31,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 371 [2024-11-16 23:46:31,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:31,496 INFO L124 PetriNetUnfolderBase]: 52/650 cut-off events. [2024-11-16 23:46:31,497 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-16 23:46:31,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 650 events. 52/650 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2859 event pairs, 28 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 695. Up to 73 conditions per place. [2024-11-16 23:46:31,504 INFO L140 encePairwiseOnDemand]: 366/371 looper letters, 15 selfloop transitions, 1 changer transitions 0/310 dead transitions. [2024-11-16 23:46:31,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 663 flow [2024-11-16 23:46:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1001 transitions. [2024-11-16 23:46:31,507 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.89937106918239 [2024-11-16 23:46:31,507 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 639 flow. Second operand 3 states and 1001 transitions. [2024-11-16 23:46:31,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 663 flow [2024-11-16 23:46:31,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 310 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:31,514 INFO L231 Difference]: Finished difference. Result has 310 places, 310 transitions, 629 flow [2024-11-16 23:46:31,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=310, PETRI_TRANSITIONS=310} [2024-11-16 23:46:31,518 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -29 predicate places. [2024-11-16 23:46:31,518 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 629 flow [2024-11-16 23:46:31,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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:46:31,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:31,519 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:31,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:46:31,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:31,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1262313505, now seen corresponding path program 1 times [2024-11-16 23:46:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855257922] [2024-11-16 23:46:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:31,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:31,563 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:46:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855257922] [2024-11-16 23:46:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855257922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076144541] [2024-11-16 23:46:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:31,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 371 [2024-11-16 23:46:31,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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:46:31,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:31,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 371 [2024-11-16 23:46:31,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:31,649 INFO L124 PetriNetUnfolderBase]: 30/588 cut-off events. [2024-11-16 23:46:31,649 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:46:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 588 events. 30/588 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2266 event pairs, 5 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 615. Up to 30 conditions per place. [2024-11-16 23:46:31,654 INFO L140 encePairwiseOnDemand]: 365/371 looper letters, 14 selfloop transitions, 3 changer transitions 0/310 dead transitions. [2024-11-16 23:46:31,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 310 transitions, 665 flow [2024-11-16 23:46:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2024-11-16 23:46:31,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9074573225516622 [2024-11-16 23:46:31,656 INFO L175 Difference]: Start difference. First operand has 310 places, 310 transitions, 629 flow. Second operand 3 states and 1010 transitions. [2024-11-16 23:46:31,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 310 transitions, 665 flow [2024-11-16 23:46:31,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 310 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:31,660 INFO L231 Difference]: Finished difference. Result has 308 places, 307 transitions, 628 flow [2024-11-16 23:46:31,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=308, PETRI_TRANSITIONS=307} [2024-11-16 23:46:31,661 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -31 predicate places. [2024-11-16 23:46:31,661 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 307 transitions, 628 flow [2024-11-16 23:46:31,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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:46:31,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:31,662 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] [2024-11-16 23:46:31,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:46:31,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:31,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:31,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1902531170, now seen corresponding path program 1 times [2024-11-16 23:46:31,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:31,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215638811] [2024-11-16 23:46:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:31,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:31,698 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:46:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215638811] [2024-11-16 23:46:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215638811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743709601] [2024-11-16 23:46:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:31,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:31,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:31,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 371 [2024-11-16 23:46:31,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 307 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:46:31,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:31,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 371 [2024-11-16 23:46:31,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:31,894 INFO L124 PetriNetUnfolderBase]: 236/2176 cut-off events. [2024-11-16 23:46:31,895 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-16 23:46:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 2176 events. 236/2176 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15626 event pairs, 61 based on Foata normal form. 0/1917 useless extension candidates. Maximal degree in co-relation 2514. Up to 305 conditions per place. [2024-11-16 23:46:31,913 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 21 selfloop transitions, 3 changer transitions 0/311 dead transitions. [2024-11-16 23:46:31,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 311 transitions, 689 flow [2024-11-16 23:46:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2024-11-16 23:46:31,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065588499550764 [2024-11-16 23:46:31,917 INFO L175 Difference]: Start difference. First operand has 308 places, 307 transitions, 628 flow. Second operand 3 states and 1009 transitions. [2024-11-16 23:46:31,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 311 transitions, 689 flow [2024-11-16 23:46:31,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 311 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:31,922 INFO L231 Difference]: Finished difference. Result has 305 places, 306 transitions, 635 flow [2024-11-16 23:46:31,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=305, PETRI_TRANSITIONS=306} [2024-11-16 23:46:31,923 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -34 predicate places. [2024-11-16 23:46:31,923 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 306 transitions, 635 flow [2024-11-16 23:46:31,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:46:31,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:31,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] [2024-11-16 23:46:31,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:46:31,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -101340205, now seen corresponding path program 1 times [2024-11-16 23:46:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207507315] [2024-11-16 23:46:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:31,951 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:46:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:31,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207507315] [2024-11-16 23:46:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207507315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:31,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:31,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308154913] [2024-11-16 23:46:31,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:31,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 371 [2024-11-16 23:46:31,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 306 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:46:31,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:31,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 371 [2024-11-16 23:46:31,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:32,070 INFO L124 PetriNetUnfolderBase]: 121/992 cut-off events. [2024-11-16 23:46:32,071 INFO L125 PetriNetUnfolderBase]: For 82/92 co-relation queries the response was YES. [2024-11-16 23:46:32,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 992 events. 121/992 cut-off events. For 82/92 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5550 event pairs, 12 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1222. Up to 116 conditions per place. [2024-11-16 23:46:32,078 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 18 selfloop transitions, 3 changer transitions 0/306 dead transitions. [2024-11-16 23:46:32,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 306 transitions, 684 flow [2024-11-16 23:46:32,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2024-11-16 23:46:32,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020664869721473 [2024-11-16 23:46:32,080 INFO L175 Difference]: Start difference. First operand has 305 places, 306 transitions, 635 flow. Second operand 3 states and 1004 transitions. [2024-11-16 23:46:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 306 transitions, 684 flow [2024-11-16 23:46:32,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 306 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:32,084 INFO L231 Difference]: Finished difference. Result has 303 places, 302 transitions, 633 flow [2024-11-16 23:46:32,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=303, PETRI_TRANSITIONS=302} [2024-11-16 23:46:32,085 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -36 predicate places. [2024-11-16 23:46:32,085 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 302 transitions, 633 flow [2024-11-16 23:46:32,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:46:32,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:32,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:46:32,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:32,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash -654620283, now seen corresponding path program 1 times [2024-11-16 23:46:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491773405] [2024-11-16 23:46:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:32,202 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:46:32,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:32,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491773405] [2024-11-16 23:46:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491773405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:32,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:32,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 23:46:32,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139800228] [2024-11-16 23:46:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 23:46:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 23:46:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:46:32,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 371 [2024-11-16 23:46:32,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 302 transitions, 633 flow. Second operand has 7 states, 7 states have (on average 326.85714285714283) internal successors, (2288), 7 states have internal predecessors, (2288), 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:46:32,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:32,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 371 [2024-11-16 23:46:32,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:32,524 INFO L124 PetriNetUnfolderBase]: 109/1116 cut-off events. [2024-11-16 23:46:32,524 INFO L125 PetriNetUnfolderBase]: For 68/114 co-relation queries the response was YES. [2024-11-16 23:46:32,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 1116 events. 109/1116 cut-off events. For 68/114 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6247 event pairs, 34 based on Foata normal form. 6/1020 useless extension candidates. Maximal degree in co-relation 1380. Up to 106 conditions per place. [2024-11-16 23:46:32,530 INFO L140 encePairwiseOnDemand]: 358/371 looper letters, 28 selfloop transitions, 14 changer transitions 0/321 dead transitions. [2024-11-16 23:46:32,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 321 transitions, 773 flow [2024-11-16 23:46:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:46:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 23:46:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3290 transitions. [2024-11-16 23:46:32,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8867924528301887 [2024-11-16 23:46:32,534 INFO L175 Difference]: Start difference. First operand has 303 places, 302 transitions, 633 flow. Second operand 10 states and 3290 transitions. [2024-11-16 23:46:32,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 321 transitions, 773 flow [2024-11-16 23:46:32,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 321 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:32,538 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 693 flow [2024-11-16 23:46:32,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=693, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2024-11-16 23:46:32,539 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -25 predicate places. [2024-11-16 23:46:32,539 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 693 flow [2024-11-16 23:46:32,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 326.85714285714283) internal successors, (2288), 7 states have internal predecessors, (2288), 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:46:32,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:32,540 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] [2024-11-16 23:46:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:46:32,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash -13702345, now seen corresponding path program 1 times [2024-11-16 23:46:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542435526] [2024-11-16 23:46:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:32,611 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:46:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:32,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542435526] [2024-11-16 23:46:32,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542435526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:32,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:32,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58552102] [2024-11-16 23:46:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 23:46:32,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:32,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 23:46:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 23:46:32,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 371 [2024-11-16 23:46:32,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 693 flow. Second operand has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:46:32,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:32,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 371 [2024-11-16 23:46:32,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:32,883 INFO L124 PetriNetUnfolderBase]: 221/2086 cut-off events. [2024-11-16 23:46:32,884 INFO L125 PetriNetUnfolderBase]: For 185/201 co-relation queries the response was YES. [2024-11-16 23:46:32,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 2086 events. 221/2086 cut-off events. For 185/201 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14608 event pairs, 68 based on Foata normal form. 11/1915 useless extension candidates. Maximal degree in co-relation 2644. Up to 218 conditions per place. [2024-11-16 23:46:32,893 INFO L140 encePairwiseOnDemand]: 365/371 looper letters, 30 selfloop transitions, 5 changer transitions 0/324 dead transitions. [2024-11-16 23:46:32,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 324 transitions, 811 flow [2024-11-16 23:46:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:46:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 23:46:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1668 transitions. [2024-11-16 23:46:32,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8991913746630728 [2024-11-16 23:46:32,896 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 693 flow. Second operand 5 states and 1668 transitions. [2024-11-16 23:46:32,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 324 transitions, 811 flow [2024-11-16 23:46:32,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 324 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:32,901 INFO L231 Difference]: Finished difference. Result has 319 places, 311 transitions, 714 flow [2024-11-16 23:46:32,901 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=714, PETRI_PLACES=319, PETRI_TRANSITIONS=311} [2024-11-16 23:46:32,902 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -20 predicate places. [2024-11-16 23:46:32,902 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 311 transitions, 714 flow [2024-11-16 23:46:32,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 329.0) internal successors, (1645), 5 states have internal predecessors, (1645), 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:46:32,903 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:32,903 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:46:32,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:46:32,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash -672836158, now seen corresponding path program 1 times [2024-11-16 23:46:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:32,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535751669] [2024-11-16 23:46:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:33,207 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:46:33,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:33,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535751669] [2024-11-16 23:46:33,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535751669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:33,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:33,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:33,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804129668] [2024-11-16 23:46:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:33,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:33,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:33,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 371 [2024-11-16 23:46:33,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 311 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 320.6666666666667) internal successors, (1924), 6 states have internal predecessors, (1924), 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:46:33,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:33,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 371 [2024-11-16 23:46:33,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:33,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L64-->L63-4: Formula: (let ((.cse15 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse3 (+ .cse15 v_~A~0.offset_150))) (let ((.cse9 (select (select |v_#memory_int_66| v_~A~0.base_150) .cse3))) (let ((.cse11 (+ .cse9 v_~mts3~0_67))) (let ((.cse1 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647)) (.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648))) (.cse2 (select |v_#race_277| v_~A~0.base_150)) (.cse5 (<= .cse11 2147483647)) (.cse10 (select |v_#race_289| v_~A~0.base_150)) (.cse8 (+ .cse15 v_~A~0.offset_150 1)) (.cse7 (+ .cse15 v_~A~0.offset_150 2)) (.cse4 (+ .cse15 v_~A~0.offset_150 3)) (.cse6 (<= 0 (+ .cse9 v_~mts3~0_67 2147483648)))) (and (not (= (ite (or .cse0 (<= v_~sum~0_48 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_48)) 1 0) 0)) (= (select .cse2 .cse3) 0) (= v_~sum~0_47 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (select .cse2 .cse4) 0) .cse1 .cse5 .cse0 .cse6 (= (select .cse2 .cse7) 0) (= |v_#race~A~0_105| 0) (= (select .cse2 .cse8) 0) (= |v_thread3Thread1of1ForFork1_plus_#res#1_17| (+ v_~sum~0_48 .cse9)) (not (= (ite (or (<= .cse9 0) .cse5) 1 0) 0)) (= (store |v_#race_289| v_~A~0.base_150 (store (store (store (store .cse10 .cse3 0) .cse8 0) .cse7 0) .cse4 0)) |v_#race_277|) (let ((.cse12 (= |v_#race~mts3~0_124| 0)) (.cse13 (= |v_#race~A~0_115| 0)) (.cse14 (= (store |v_#race_279| v_~A~0.base_150 (store (store (store (store (select |v_#race_279| v_~A~0.base_150) .cse3 0) .cse8 0) .cse7 0) .cse4 0)) |v_#race_289|))) (or (and (< .cse11 0) .cse12 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_94|) (= v_~mts3~0_66 0) .cse13 .cse14) (and (= (select .cse10 .cse8) 0) (= (select .cse10 .cse3) 0) (<= 0 .cse11) .cse12 (= |v_thread3_#t~mem15#1_94| .cse9) (= (select .cse10 .cse7) 0) .cse13 .cse14 (= (select .cse10 .cse4) 0) (= (+ |v_thread3_#t~mem15#1_94| v_~mts3~0_67) v_~mts3~0_66)))) (not (= (ite (or .cse6 (<= 0 .cse9)) 1 0) 0)))))))) InVars {#race=|v_#race_279|, ~sum~0=v_~sum~0_48, ~A~0.base=v_~A~0.base_150, ~mts3~0=v_~mts3~0_67, ~A~0.offset=v_~A~0.offset_150, #memory_int=|v_#memory_int_66|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{~A~0.base=v_~A~0.base_150, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_47, #race~mts3~0=|v_#race~mts3~0_114|, ~mts3~0=v_~mts3~0_66, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_63|, #race=|v_#race_277|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_150, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, #memory_int=|v_#memory_int_66|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_105|} AuxVars[|v_#race_289|, |v_#race~mts3~0_124|, |v_thread3_#t~mem15#1_94|, |v_#race~A~0_115|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][179], [Black: 420#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 419#(<= (+ ~M~0 1) 0), Black: 388#true, 53#L48-34true, 94#L86-1true, 136#L63-4true, 390#(= |#race~A~0| 0), 372#(= |#race~N~0| 0), 423#true, 13#L59true, 416#true, 384#(= |#race~M~0| 0), Black: 400#(<= ~N~0 0), Black: 407#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 405#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0))]) [2024-11-16 23:46:33,689 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-11-16 23:46:33,689 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-16 23:46:33,689 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-16 23:46:33,689 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-16 23:46:33,754 INFO L124 PetriNetUnfolderBase]: 406/2435 cut-off events. [2024-11-16 23:46:33,755 INFO L125 PetriNetUnfolderBase]: For 451/465 co-relation queries the response was YES. [2024-11-16 23:46:33,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3519 conditions, 2435 events. 406/2435 cut-off events. For 451/465 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 18065 event pairs, 71 based on Foata normal form. 0/2210 useless extension candidates. Maximal degree in co-relation 3470. Up to 281 conditions per place. [2024-11-16 23:46:33,766 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 36 selfloop transitions, 5 changer transitions 0/321 dead transitions. [2024-11-16 23:46:33,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 321 transitions, 832 flow [2024-11-16 23:46:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1954 transitions. [2024-11-16 23:46:33,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778077268643306 [2024-11-16 23:46:33,770 INFO L175 Difference]: Start difference. First operand has 319 places, 311 transitions, 714 flow. Second operand 6 states and 1954 transitions. [2024-11-16 23:46:33,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 321 transitions, 832 flow [2024-11-16 23:46:33,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 321 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:33,775 INFO L231 Difference]: Finished difference. Result has 320 places, 309 transitions, 715 flow [2024-11-16 23:46:33,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=320, PETRI_TRANSITIONS=309} [2024-11-16 23:46:33,777 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -19 predicate places. [2024-11-16 23:46:33,777 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 309 transitions, 715 flow [2024-11-16 23:46:33,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 320.6666666666667) internal successors, (1924), 6 states have internal predecessors, (1924), 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:46:33,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:33,778 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:33,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:46:33,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:33,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:33,779 INFO L85 PathProgramCache]: Analyzing trace with hash -4100489, now seen corresponding path program 1 times [2024-11-16 23:46:33,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:33,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021992792] [2024-11-16 23:46:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:33,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:46:34,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:34,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021992792] [2024-11-16 23:46:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021992792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:34,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:34,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583239788] [2024-11-16 23:46:34,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:34,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:34,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:34,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 371 [2024-11-16 23:46:34,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 309 transitions, 715 flow. Second operand has 6 states, 6 states have (on average 321.1666666666667) internal successors, (1927), 6 states have internal predecessors, (1927), 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:46:34,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:34,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 371 [2024-11-16 23:46:34,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:34,427 INFO L124 PetriNetUnfolderBase]: 251/1803 cut-off events. [2024-11-16 23:46:34,427 INFO L125 PetriNetUnfolderBase]: For 240/320 co-relation queries the response was YES. [2024-11-16 23:46:34,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2668 conditions, 1803 events. 251/1803 cut-off events. For 240/320 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12829 event pairs, 50 based on Foata normal form. 4/1682 useless extension candidates. Maximal degree in co-relation 2619. Up to 221 conditions per place. [2024-11-16 23:46:34,440 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 36 selfloop transitions, 5 changer transitions 0/319 dead transitions. [2024-11-16 23:46:34,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 319 transitions, 833 flow [2024-11-16 23:46:34,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1954 transitions. [2024-11-16 23:46:34,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778077268643306 [2024-11-16 23:46:34,444 INFO L175 Difference]: Start difference. First operand has 320 places, 309 transitions, 715 flow. Second operand 6 states and 1954 transitions. [2024-11-16 23:46:34,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 319 transitions, 833 flow [2024-11-16 23:46:34,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 319 transitions, 823 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:34,450 INFO L231 Difference]: Finished difference. Result has 318 places, 307 transitions, 711 flow [2024-11-16 23:46:34,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=711, PETRI_PLACES=318, PETRI_TRANSITIONS=307} [2024-11-16 23:46:34,452 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -21 predicate places. [2024-11-16 23:46:34,452 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 307 transitions, 711 flow [2024-11-16 23:46:34,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 321.1666666666667) internal successors, (1927), 6 states have internal predecessors, (1927), 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:46:34,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:34,453 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] [2024-11-16 23:46:34,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:46:34,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:34,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash 301645857, now seen corresponding path program 1 times [2024-11-16 23:46:34,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:34,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887161914] [2024-11-16 23:46:34,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:34,478 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:46:34,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887161914] [2024-11-16 23:46:34,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887161914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:34,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:34,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:34,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36003943] [2024-11-16 23:46:34,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:34,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:34,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:34,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:34,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 371 [2024-11-16 23:46:34,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 307 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 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:46:34,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:34,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 371 [2024-11-16 23:46:34,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:34,599 INFO L124 PetriNetUnfolderBase]: 73/1185 cut-off events. [2024-11-16 23:46:34,599 INFO L125 PetriNetUnfolderBase]: For 74/96 co-relation queries the response was YES. [2024-11-16 23:46:34,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1185 events. 73/1185 cut-off events. For 74/96 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6838 event pairs, 11 based on Foata normal form. 8/1128 useless extension candidates. Maximal degree in co-relation 1461. Up to 99 conditions per place. [2024-11-16 23:46:34,604 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 9 selfloop transitions, 1 changer transitions 2/305 dead transitions. [2024-11-16 23:46:34,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 305 transitions, 729 flow [2024-11-16 23:46:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-16 23:46:34,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9110512129380054 [2024-11-16 23:46:34,607 INFO L175 Difference]: Start difference. First operand has 318 places, 307 transitions, 711 flow. Second operand 3 states and 1014 transitions. [2024-11-16 23:46:34,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 305 transitions, 729 flow [2024-11-16 23:46:34,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 305 transitions, 719 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:34,610 INFO L231 Difference]: Finished difference. Result has 313 places, 303 transitions, 695 flow [2024-11-16 23:46:34,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=313, PETRI_TRANSITIONS=303} [2024-11-16 23:46:34,611 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -26 predicate places. [2024-11-16 23:46:34,611 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 303 transitions, 695 flow [2024-11-16 23:46:34,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 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:46:34,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:34,612 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] [2024-11-16 23:46:34,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:46:34,612 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:34,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:34,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2120142892, now seen corresponding path program 1 times [2024-11-16 23:46:34,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:34,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423318770] [2024-11-16 23:46:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:34,636 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:46:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423318770] [2024-11-16 23:46:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423318770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:34,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997057064] [2024-11-16 23:46:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:34,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:34,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:34,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:34,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 371 [2024-11-16 23:46:34,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 303 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 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:46:34,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:34,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 371 [2024-11-16 23:46:34,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:34,743 INFO L124 PetriNetUnfolderBase]: 73/1153 cut-off events. [2024-11-16 23:46:34,744 INFO L125 PetriNetUnfolderBase]: For 74/96 co-relation queries the response was YES. [2024-11-16 23:46:34,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1153 events. 73/1153 cut-off events. For 74/96 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6529 event pairs, 11 based on Foata normal form. 8/1112 useless extension candidates. Maximal degree in co-relation 1407. Up to 99 conditions per place. [2024-11-16 23:46:34,751 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 6 selfloop transitions, 0 changer transitions 14/301 dead transitions. [2024-11-16 23:46:34,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 301 transitions, 713 flow [2024-11-16 23:46:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-16 23:46:34,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9110512129380054 [2024-11-16 23:46:34,753 INFO L175 Difference]: Start difference. First operand has 313 places, 303 transitions, 695 flow. Second operand 3 states and 1014 transitions. [2024-11-16 23:46:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 301 transitions, 713 flow [2024-11-16 23:46:34,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 301 transitions, 712 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:34,757 INFO L231 Difference]: Finished difference. Result has 310 places, 287 transitions, 659 flow [2024-11-16 23:46:34,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=310, PETRI_TRANSITIONS=287} [2024-11-16 23:46:34,757 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -29 predicate places. [2024-11-16 23:46:34,758 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 287 transitions, 659 flow [2024-11-16 23:46:34,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 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:46:34,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:34,758 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] [2024-11-16 23:46:34,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:46:34,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:34,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash 166332279, now seen corresponding path program 1 times [2024-11-16 23:46:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:34,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14017925] [2024-11-16 23:46:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:34,787 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:46:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14017925] [2024-11-16 23:46:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14017925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823437754] [2024-11-16 23:46:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:34,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:34,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:34,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 371 [2024-11-16 23:46:34,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 287 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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:46:34,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:34,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 371 [2024-11-16 23:46:34,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:34,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1148] L64-->L63-4: Formula: (let ((.cse15 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse3 (+ .cse15 v_~A~0.offset_150))) (let ((.cse9 (select (select |v_#memory_int_66| v_~A~0.base_150) .cse3))) (let ((.cse11 (+ .cse9 v_~mts3~0_67))) (let ((.cse1 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647)) (.cse0 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648))) (.cse2 (select |v_#race_277| v_~A~0.base_150)) (.cse5 (<= .cse11 2147483647)) (.cse10 (select |v_#race_289| v_~A~0.base_150)) (.cse8 (+ .cse15 v_~A~0.offset_150 1)) (.cse7 (+ .cse15 v_~A~0.offset_150 2)) (.cse4 (+ .cse15 v_~A~0.offset_150 3)) (.cse6 (<= 0 (+ .cse9 v_~mts3~0_67 2147483648)))) (and (not (= (ite (or .cse0 (<= v_~sum~0_48 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) (not (= (ite (or .cse1 (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_48)) 1 0) 0)) (= (select .cse2 .cse3) 0) (= v_~sum~0_47 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (select .cse2 .cse4) 0) .cse1 .cse5 .cse0 .cse6 (= (select .cse2 .cse7) 0) (= |v_#race~A~0_105| 0) (= (select .cse2 .cse8) 0) (= |v_thread3Thread1of1ForFork1_plus_#res#1_17| (+ v_~sum~0_48 .cse9)) (not (= (ite (or (<= .cse9 0) .cse5) 1 0) 0)) (= (store |v_#race_289| v_~A~0.base_150 (store (store (store (store .cse10 .cse3 0) .cse8 0) .cse7 0) .cse4 0)) |v_#race_277|) (let ((.cse12 (= |v_#race~mts3~0_124| 0)) (.cse13 (= |v_#race~A~0_115| 0)) (.cse14 (= (store |v_#race_279| v_~A~0.base_150 (store (store (store (store (select |v_#race_279| v_~A~0.base_150) .cse3 0) .cse8 0) .cse7 0) .cse4 0)) |v_#race_289|))) (or (and (< .cse11 0) .cse12 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_94|) (= v_~mts3~0_66 0) .cse13 .cse14) (and (= (select .cse10 .cse8) 0) (= (select .cse10 .cse3) 0) (<= 0 .cse11) .cse12 (= |v_thread3_#t~mem15#1_94| .cse9) (= (select .cse10 .cse7) 0) .cse13 .cse14 (= (select .cse10 .cse4) 0) (= (+ |v_thread3_#t~mem15#1_94| v_~mts3~0_67) v_~mts3~0_66)))) (not (= (ite (or .cse6 (<= 0 .cse9)) 1 0) 0)))))))) InVars {#race=|v_#race_279|, ~sum~0=v_~sum~0_48, ~A~0.base=v_~A~0.base_150, ~mts3~0=v_~mts3~0_67, ~A~0.offset=v_~A~0.offset_150, #memory_int=|v_#memory_int_66|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{~A~0.base=v_~A~0.base_150, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_47, #race~mts3~0=|v_#race~mts3~0_114|, ~mts3~0=v_~mts3~0_66, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_63|, #race=|v_#race_277|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_150, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, #memory_int=|v_#memory_int_66|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_105|} AuxVars[|v_#race_289|, |v_#race~mts3~0_124|, |v_thread3_#t~mem15#1_94|, |v_#race~A~0_115|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][176], [Black: 420#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork2_~i~1#1| 0)), Black: 419#(<= (+ ~M~0 1) 0), Black: 388#true, 438#true, 53#L48-34true, 94#L86-1true, 136#L63-4true, 390#(= |#race~A~0| 0), 372#(= |#race~N~0| 0), 384#(= |#race~M~0| 0), Black: 400#(<= ~N~0 0), Black: 407#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 188#L56-36true, Black: 405#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 441#true, Black: 401#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0))]) [2024-11-16 23:46:34,988 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-11-16 23:46:34,988 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-16 23:46:34,989 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-11-16 23:46:34,989 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-16 23:46:35,044 INFO L124 PetriNetUnfolderBase]: 205/1868 cut-off events. [2024-11-16 23:46:35,044 INFO L125 PetriNetUnfolderBase]: For 170/175 co-relation queries the response was YES. [2024-11-16 23:46:35,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 1868 events. 205/1868 cut-off events. For 170/175 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 12104 event pairs, 54 based on Foata normal form. 0/1746 useless extension candidates. Maximal degree in co-relation 2407. Up to 200 conditions per place. [2024-11-16 23:46:35,054 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 12 selfloop transitions, 2 changer transitions 7/289 dead transitions. [2024-11-16 23:46:35,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 289 transitions, 697 flow [2024-11-16 23:46:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1008 transitions. [2024-11-16 23:46:35,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9056603773584906 [2024-11-16 23:46:35,056 INFO L175 Difference]: Start difference. First operand has 310 places, 287 transitions, 659 flow. Second operand 3 states and 1008 transitions. [2024-11-16 23:46:35,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 289 transitions, 697 flow [2024-11-16 23:46:35,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 289 transitions, 697 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:46:35,060 INFO L231 Difference]: Finished difference. Result has 295 places, 280 transitions, 629 flow [2024-11-16 23:46:35,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=295, PETRI_TRANSITIONS=280} [2024-11-16 23:46:35,060 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -44 predicate places. [2024-11-16 23:46:35,060 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 280 transitions, 629 flow [2024-11-16 23:46:35,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 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:46:35,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:35,061 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:35,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:46:35,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-16 23:46:35,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1445354836, now seen corresponding path program 1 times [2024-11-16 23:46:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173829823] [2024-11-16 23:46:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:46:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173829823] [2024-11-16 23:46:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173829823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958598299] [2024-11-16 23:46:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:35,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:35,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 371 [2024-11-16 23:46:35,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 280 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 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:46:35,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:35,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 371 [2024-11-16 23:46:35,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:35,262 INFO L124 PetriNetUnfolderBase]: 125/1617 cut-off events. [2024-11-16 23:46:35,262 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-16 23:46:35,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2017 conditions, 1617 events. 125/1617 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9799 event pairs, 37 based on Foata normal form. 0/1524 useless extension candidates. Maximal degree in co-relation 2006. Up to 131 conditions per place. [2024-11-16 23:46:35,272 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 0 selfloop transitions, 0 changer transitions 282/282 dead transitions. [2024-11-16 23:46:35,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 282 transitions, 667 flow [2024-11-16 23:46:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-11-16 23:46:35,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9083557951482479 [2024-11-16 23:46:35,274 INFO L175 Difference]: Start difference. First operand has 295 places, 280 transitions, 629 flow. Second operand 3 states and 1011 transitions. [2024-11-16 23:46:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 282 transitions, 667 flow [2024-11-16 23:46:35,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 643 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-16 23:46:35,277 INFO L231 Difference]: Finished difference. Result has 284 places, 0 transitions, 0 flow [2024-11-16 23:46:35,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=284, PETRI_TRANSITIONS=0} [2024-11-16 23:46:35,278 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -55 predicate places. [2024-11-16 23:46:35,278 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 0 transitions, 0 flow [2024-11-16 23:46:35,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 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:46:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 76 remaining) [2024-11-16 23:46:35,281 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 76 remaining) [2024-11-16 23:46:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 76 remaining) [2024-11-16 23:46:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 76 remaining) [2024-11-16 23:46:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 76 remaining) [2024-11-16 23:46:35,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (67 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (66 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (63 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 76 remaining) [2024-11-16 23:46:35,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (59 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (58 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (57 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (56 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (55 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (54 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 76 remaining) [2024-11-16 23:46:35,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (52 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (51 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (49 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (48 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (47 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (46 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (45 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (44 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (43 of 76 remaining) [2024-11-16 23:46:35,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (42 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (41 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (37 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 76 remaining) [2024-11-16 23:46:35,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (27 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 76 remaining) [2024-11-16 23:46:35,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (23 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (21 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (16 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 76 remaining) [2024-11-16 23:46:35,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 76 remaining) [2024-11-16 23:46:35,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 76 remaining) [2024-11-16 23:46:35,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 76 remaining) [2024-11-16 23:46:35,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 76 remaining) [2024-11-16 23:46:35,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 76 remaining) [2024-11-16 23:46:35,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 76 remaining) [2024-11-16 23:46:35,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 76 remaining) [2024-11-16 23:46:35,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:46:35,290 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:35,295 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:46:35,295 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:46:35,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:46:35 BasicIcfg [2024-11-16 23:46:35,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:46:35,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:46:35,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:46:35,299 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:46:35,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:28" (3/4) ... [2024-11-16 23:46:35,301 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:46:35,303 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:46:35,303 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:46:35,303 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-16 23:46:35,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-16 23:46:35,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:46:35,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:46:35,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:46:35,387 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:46:35,388 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:46:35,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:46:35,388 INFO L158 Benchmark]: Toolchain (without parser) took 7627.74ms. Allocated memory was 172.0MB in the beginning and 461.4MB in the end (delta: 289.4MB). Free memory was 106.1MB in the beginning and 172.4MB in the end (delta: -66.4MB). Peak memory consumption was 223.8MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,389 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 139.5MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:46:35,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.75ms. Allocated memory is still 172.0MB. Free memory was 106.1MB in the beginning and 137.4MB in the end (delta: -31.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.80ms. Allocated memory is still 172.0MB. Free memory was 136.4MB in the beginning and 133.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,390 INFO L158 Benchmark]: Boogie Preprocessor took 36.37ms. Allocated memory is still 172.0MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,390 INFO L158 Benchmark]: IcfgBuilder took 817.80ms. Allocated memory is still 172.0MB. Free memory was 131.1MB in the beginning and 63.0MB in the end (delta: 68.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,391 INFO L158 Benchmark]: TraceAbstraction took 6302.82ms. Allocated memory was 172.0MB in the beginning and 461.4MB in the end (delta: 289.4MB). Free memory was 63.0MB in the beginning and 178.7MB in the end (delta: -115.8MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,391 INFO L158 Benchmark]: Witness Printer took 88.58ms. Allocated memory is still 461.4MB. Free memory was 178.7MB in the beginning and 172.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 23:46:35,392 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.15ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 139.5MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.75ms. Allocated memory is still 172.0MB. Free memory was 106.1MB in the beginning and 137.4MB in the end (delta: -31.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.80ms. Allocated memory is still 172.0MB. Free memory was 136.4MB in the beginning and 133.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.37ms. Allocated memory is still 172.0MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 817.80ms. Allocated memory is still 172.0MB. Free memory was 131.1MB in the beginning and 63.0MB in the end (delta: 68.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6302.82ms. Allocated memory was 172.0MB in the beginning and 461.4MB in the end (delta: 289.4MB). Free memory was 63.0MB in the beginning and 178.7MB in the end (delta: -115.8MB). Peak memory consumption was 176.7MB. Max. memory is 16.1GB. * Witness Printer took 88.58ms. Allocated memory is still 461.4MB. Free memory was 178.7MB in the beginning and 172.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 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: 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: 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: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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 7 procedures, 535 locations, 76 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: 6.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1003 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 560 mSDsluCounter, 496 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1435 IncrementalHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 68 mSDtfsCounter, 1435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=12, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1537 ConstructedInterpolants, 0 QuantifiedInterpolants, 2134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 4/4 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 23:46:35,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE