./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.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 ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:58:51,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:58:51,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:58:51,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:58:51,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:58:51,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:58:51,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:58:51,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:58:51,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:58:51,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:58:51,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:58:51,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:58:51,767 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:58:51,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:58:51,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:58:51,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:58:51,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:58:51,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:58:51,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:58:51,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:58:51,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:58:51,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:58:51,772 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:58:51,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:58:51,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:58:51,772 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:58:51,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:58:51,773 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:58:51,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:58:51,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:58:51,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:58:51,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:51,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:58:51,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:58:51,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:58:51,776 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 -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-19 05:58:51,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:58:51,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:58:51,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:58:51,995 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:58:51,995 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:58:51,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-19 05:58:53,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:58:53,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:58:53,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-19 05:58:53,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c5395bf/3e39f48c54684313a95d684c52d2d086/FLAG7285337fe [2024-11-19 05:58:53,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c5395bf/3e39f48c54684313a95d684c52d2d086 [2024-11-19 05:58:53,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:58:53,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:58:53,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:53,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:58:53,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:58:53,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1d4b63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53, skipping insertion in model container [2024-11-19 05:58:53,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:58:53,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:53,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:58:53,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:53,614 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:58:53,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53 WrapperNode [2024-11-19 05:58:53,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:53,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:53,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:58:53,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:58:53,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,647 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2024-11-19 05:58:53,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:53,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:58:53,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:58:53,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:58:53,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,662 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:58:53,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:58:53,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:58:53,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:58:53,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (1/1) ... [2024-11-19 05:58:53,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:53,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:58:53,704 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-19 05:58:53,706 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-19 05:58:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:58:53,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:58:53,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:58:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:58:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:58:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:58:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:58:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 05:58:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 05:58:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:58:53,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:58:53,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:58:53,741 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:58:53,817 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:58:53,818 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:58:54,110 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:58:54,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:58:54,136 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:58:54,136 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 05:58:54,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:54 BoogieIcfgContainer [2024-11-19 05:58:54,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:58:54,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:58:54,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:58:54,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:58:54,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:58:53" (1/3) ... [2024-11-19 05:58:54,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d6b1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:54, skipping insertion in model container [2024-11-19 05:58:54,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:53" (2/3) ... [2024-11-19 05:58:54,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d6b1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:54, skipping insertion in model container [2024-11-19 05:58:54,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:54" (3/3) ... [2024-11-19 05:58:54,146 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-19 05:58:54,159 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:58:54,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-19 05:58:54,159 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:58:54,242 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 05:58:54,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 235 transitions, 498 flow [2024-11-19 05:58:54,343 INFO L124 PetriNetUnfolderBase]: 9/231 cut-off events. [2024-11-19 05:58:54,345 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:58:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 231 events. 9/231 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 349 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2024-11-19 05:58:54,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 235 transitions, 498 flow [2024-11-19 05:58:54,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 214 transitions, 449 flow [2024-11-19 05:58:54,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:58:54,371 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;@5b5ff64d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:58:54,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-19 05:58:54,375 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:58:54,375 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:58:54,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:58:54,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:54,376 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] [2024-11-19 05:58:54,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -578257067, now seen corresponding path program 1 times [2024-11-19 05:58:54,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:54,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359758923] [2024-11-19 05:58:54,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:54,542 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-19 05:58:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:54,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359758923] [2024-11-19 05:58:54,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359758923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:54,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:54,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:54,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379761170] [2024-11-19 05:58:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:54,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:54,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:54,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:54,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2024-11-19 05:58:54,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:54,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:54,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2024-11-19 05:58:54,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:55,040 INFO L124 PetriNetUnfolderBase]: 527/3114 cut-off events. [2024-11-19 05:58:55,041 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-11-19 05:58:55,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 3114 events. 527/3114 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 28033 event pairs, 434 based on Foata normal form. 191/2813 useless extension candidates. Maximal degree in co-relation 3687. Up to 677 conditions per place. [2024-11-19 05:58:55,069 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 20 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2024-11-19 05:58:55,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 481 flow [2024-11-19 05:58:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2024-11-19 05:58:55,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9035460992907801 [2024-11-19 05:58:55,086 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 449 flow. Second operand 3 states and 637 transitions. [2024-11-19 05:58:55,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 481 flow [2024-11-19 05:58:55,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 468 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:58:55,095 INFO L231 Difference]: Finished difference. Result has 213 places, 207 transitions, 426 flow [2024-11-19 05:58:55,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=213, PETRI_TRANSITIONS=207} [2024-11-19 05:58:55,101 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -6 predicate places. [2024-11-19 05:58:55,102 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 207 transitions, 426 flow [2024-11-19 05:58:55,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:55,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:55,103 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] [2024-11-19 05:58:55,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:58:55,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:55,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash -879382998, now seen corresponding path program 1 times [2024-11-19 05:58:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922943884] [2024-11-19 05:58:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:55,151 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-19 05:58:55,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:55,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922943884] [2024-11-19 05:58:55,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922943884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:55,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:55,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296775453] [2024-11-19 05:58:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:55,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:55,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:55,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:55,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2024-11-19 05:58:55,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 207 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:55,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:55,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2024-11-19 05:58:55,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:55,551 INFO L124 PetriNetUnfolderBase]: 561/3050 cut-off events. [2024-11-19 05:58:55,552 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-19 05:58:55,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 3050 events. 561/3050 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 26818 event pairs, 474 based on Foata normal form. 0/2564 useless extension candidates. Maximal degree in co-relation 3864. Up to 733 conditions per place. [2024-11-19 05:58:55,572 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 20 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-11-19 05:58:55,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 468 flow [2024-11-19 05:58:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2024-11-19 05:58:55,574 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2024-11-19 05:58:55,574 INFO L175 Difference]: Start difference. First operand has 213 places, 207 transitions, 426 flow. Second operand 3 states and 632 transitions. [2024-11-19 05:58:55,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 468 flow [2024-11-19 05:58:55,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:55,581 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 424 flow [2024-11-19 05:58:55,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2024-11-19 05:58:55,582 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -8 predicate places. [2024-11-19 05:58:55,582 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 424 flow [2024-11-19 05:58:55,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:55,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:55,583 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] [2024-11-19 05:58:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:58:55,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1772624164, now seen corresponding path program 1 times [2024-11-19 05:58:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:55,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730570594] [2024-11-19 05:58:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:55,634 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-19 05:58:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730570594] [2024-11-19 05:58:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730570594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948252770] [2024-11-19 05:58:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:55,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2024-11-19 05:58:55,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:55,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:55,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2024-11-19 05:58:55,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:55,923 INFO L124 PetriNetUnfolderBase]: 543/2599 cut-off events. [2024-11-19 05:58:55,923 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-19 05:58:55,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3441 conditions, 2599 events. 543/2599 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 21671 event pairs, 474 based on Foata normal form. 0/2181 useless extension candidates. Maximal degree in co-relation 3399. Up to 733 conditions per place. [2024-11-19 05:58:55,940 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 20 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2024-11-19 05:58:55,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 205 transitions, 466 flow [2024-11-19 05:58:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2024-11-19 05:58:55,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2024-11-19 05:58:55,942 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 424 flow. Second operand 3 states and 632 transitions. [2024-11-19 05:58:55,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 205 transitions, 466 flow [2024-11-19 05:58:55,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 205 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:55,945 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 422 flow [2024-11-19 05:58:55,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2024-11-19 05:58:55,946 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -9 predicate places. [2024-11-19 05:58:55,946 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 422 flow [2024-11-19 05:58:55,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:55,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:55,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:55,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:58:55,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:55,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1586379333, now seen corresponding path program 1 times [2024-11-19 05:58:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:55,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787850808] [2024-11-19 05:58:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:56,002 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-19 05:58:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787850808] [2024-11-19 05:58:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787850808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:56,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:56,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:56,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696916918] [2024-11-19 05:58:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:56,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:56,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:56,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:56,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:56,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 235 [2024-11-19 05:58:56,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:56,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:56,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 235 [2024-11-19 05:58:56,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:56,370 INFO L124 PetriNetUnfolderBase]: 531/3264 cut-off events. [2024-11-19 05:58:56,370 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-19 05:58:56,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 3264 events. 531/3264 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 29258 event pairs, 434 based on Foata normal form. 0/2760 useless extension candidates. Maximal degree in co-relation 3964. Up to 677 conditions per place. [2024-11-19 05:58:56,396 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 20 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2024-11-19 05:58:56,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 464 flow [2024-11-19 05:58:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2024-11-19 05:58:56,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2024-11-19 05:58:56,438 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 422 flow. Second operand 3 states and 632 transitions. [2024-11-19 05:58:56,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 464 flow [2024-11-19 05:58:56,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 204 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:56,440 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 420 flow [2024-11-19 05:58:56,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2024-11-19 05:58:56,442 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -10 predicate places. [2024-11-19 05:58:56,442 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 420 flow [2024-11-19 05:58:56,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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-19 05:58:56,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:56,443 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] [2024-11-19 05:58:56,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:58:56,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:56,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2145211804, now seen corresponding path program 1 times [2024-11-19 05:58:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406795988] [2024-11-19 05:58:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:56,497 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-19 05:58:56,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:56,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406795988] [2024-11-19 05:58:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406795988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:56,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:56,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675809026] [2024-11-19 05:58:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:56,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:56,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:56,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2024-11-19 05:58:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-19 05:58:56,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:56,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2024-11-19 05:58:56,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:56,828 INFO L124 PetriNetUnfolderBase]: 767/3562 cut-off events. [2024-11-19 05:58:56,829 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-19 05:58:56,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 3562 events. 767/3562 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32948 event pairs, 515 based on Foata normal form. 0/3030 useless extension candidates. Maximal degree in co-relation 4723. Up to 796 conditions per place. [2024-11-19 05:58:56,848 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-11-19 05:58:56,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 212 transitions, 500 flow [2024-11-19 05:58:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2024-11-19 05:58:56,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2024-11-19 05:58:56,850 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 420 flow. Second operand 3 states and 646 transitions. [2024-11-19 05:58:56,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 212 transitions, 500 flow [2024-11-19 05:58:56,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 212 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:56,853 INFO L231 Difference]: Finished difference. Result has 208 places, 203 transitions, 418 flow [2024-11-19 05:58:56,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=208, PETRI_TRANSITIONS=203} [2024-11-19 05:58:56,854 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -11 predicate places. [2024-11-19 05:58:56,854 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 203 transitions, 418 flow [2024-11-19 05:58:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 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-19 05:58:56,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:56,856 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] [2024-11-19 05:58:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:58:56,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:56,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 12936735, now seen corresponding path program 1 times [2024-11-19 05:58:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:56,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046439916] [2024-11-19 05:58:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:56,899 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-19 05:58:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046439916] [2024-11-19 05:58:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046439916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20243126] [2024-11-19 05:58:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:56,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2024-11-19 05:58:56,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 203 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-19 05:58:56,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:56,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2024-11-19 05:58:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:57,101 INFO L124 PetriNetUnfolderBase]: 563/2526 cut-off events. [2024-11-19 05:58:57,101 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-19 05:58:57,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 2526 events. 563/2526 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 21785 event pairs, 204 based on Foata normal form. 0/2198 useless extension candidates. Maximal degree in co-relation 2358. Up to 470 conditions per place. [2024-11-19 05:58:57,115 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 27 selfloop transitions, 1 changer transitions 0/211 dead transitions. [2024-11-19 05:58:57,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 211 transitions, 494 flow [2024-11-19 05:58:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-11-19 05:58:57,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2024-11-19 05:58:57,117 INFO L175 Difference]: Start difference. First operand has 208 places, 203 transitions, 418 flow. Second operand 3 states and 650 transitions. [2024-11-19 05:58:57,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 211 transitions, 494 flow [2024-11-19 05:58:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 211 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:57,120 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 414 flow [2024-11-19 05:58:57,120 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2024-11-19 05:58:57,120 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2024-11-19 05:58:57,121 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 414 flow [2024-11-19 05:58:57,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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-19 05:58:57,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:57,121 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] [2024-11-19 05:58:57,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:58:57,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:57,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1900918386, now seen corresponding path program 1 times [2024-11-19 05:58:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29374006] [2024-11-19 05:58:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:57,157 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-19 05:58:57,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:57,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29374006] [2024-11-19 05:58:57,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29374006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198946090] [2024-11-19 05:58:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:57,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:57,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:57,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:57,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2024-11-19 05:58:57,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-19 05:58:57,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:57,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2024-11-19 05:58:57,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:57,477 INFO L124 PetriNetUnfolderBase]: 875/3414 cut-off events. [2024-11-19 05:58:57,477 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-19 05:58:57,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4776 conditions, 3414 events. 875/3414 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 30018 event pairs, 575 based on Foata normal form. 0/2910 useless extension candidates. Maximal degree in co-relation 3540. Up to 880 conditions per place. [2024-11-19 05:58:57,499 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-11-19 05:58:57,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 210 transitions, 494 flow [2024-11-19 05:58:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2024-11-19 05:58:57,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2024-11-19 05:58:57,502 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 414 flow. Second operand 3 states and 646 transitions. [2024-11-19 05:58:57,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 210 transitions, 494 flow [2024-11-19 05:58:57,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 210 transitions, 493 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:57,506 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 415 flow [2024-11-19 05:58:57,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2024-11-19 05:58:57,507 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2024-11-19 05:58:57,507 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 415 flow [2024-11-19 05:58:57,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-19 05:58:57,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:57,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:57,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:58:57,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:57,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash -213432431, now seen corresponding path program 1 times [2024-11-19 05:58:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:57,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345015544] [2024-11-19 05:58:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:57,553 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-19 05:58:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345015544] [2024-11-19 05:58:57,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345015544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:57,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:57,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985597763] [2024-11-19 05:58:57,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:57,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:57,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:57,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:57,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:57,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2024-11-19 05:58:57,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-19 05:58:57,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:57,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2024-11-19 05:58:57,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:57,855 INFO L124 PetriNetUnfolderBase]: 652/2799 cut-off events. [2024-11-19 05:58:57,855 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-19 05:58:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2799 events. 652/2799 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 23752 event pairs, 323 based on Foata normal form. 0/2454 useless extension candidates. Maximal degree in co-relation 2821. Up to 473 conditions per place. [2024-11-19 05:58:57,877 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 27 selfloop transitions, 1 changer transitions 0/209 dead transitions. [2024-11-19 05:58:57,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 209 transitions, 491 flow [2024-11-19 05:58:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-11-19 05:58:57,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2024-11-19 05:58:57,880 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 415 flow. Second operand 3 states and 650 transitions. [2024-11-19 05:58:57,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 209 transitions, 491 flow [2024-11-19 05:58:57,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:57,917 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 411 flow [2024-11-19 05:58:57,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2024-11-19 05:58:57,918 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2024-11-19 05:58:57,918 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 411 flow [2024-11-19 05:58:57,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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-19 05:58:57,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:57,920 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] [2024-11-19 05:58:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:58:57,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2115897202, now seen corresponding path program 1 times [2024-11-19 05:58:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:57,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880290498] [2024-11-19 05:58:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:57,956 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-19 05:58:57,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880290498] [2024-11-19 05:58:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880290498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:57,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:57,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:57,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015541215] [2024-11-19 05:58:57,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:57,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:57,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:57,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:57,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2024-11-19 05:58:57,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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-19 05:58:57,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:57,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2024-11-19 05:58:57,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:58,175 INFO L124 PetriNetUnfolderBase]: 848/2824 cut-off events. [2024-11-19 05:58:58,175 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2024-11-19 05:58:58,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4193 conditions, 2824 events. 848/2824 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22243 event pairs, 548 based on Foata normal form. 0/2475 useless extension candidates. Maximal degree in co-relation 2912. Up to 880 conditions per place. [2024-11-19 05:58:58,194 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2024-11-19 05:58:58,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 208 transitions, 491 flow [2024-11-19 05:58:58,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2024-11-19 05:58:58,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2024-11-19 05:58:58,196 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 411 flow. Second operand 3 states and 646 transitions. [2024-11-19 05:58:58,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 208 transitions, 491 flow [2024-11-19 05:58:58,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:58,199 INFO L231 Difference]: Finished difference. Result has 206 places, 199 transitions, 412 flow [2024-11-19 05:58:58,200 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=206, PETRI_TRANSITIONS=199} [2024-11-19 05:58:58,200 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2024-11-19 05:58:58,200 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 199 transitions, 412 flow [2024-11-19 05:58:58,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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-19 05:58:58,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:58,201 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] [2024-11-19 05:58:58,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:58:58,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1457118667, now seen corresponding path program 1 times [2024-11-19 05:58:58,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:58,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112448384] [2024-11-19 05:58:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:58,233 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-19 05:58:58,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112448384] [2024-11-19 05:58:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112448384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723648729] [2024-11-19 05:58:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:58,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2024-11-19 05:58:58,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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-19 05:58:58,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:58,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2024-11-19 05:58:58,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:58,431 INFO L124 PetriNetUnfolderBase]: 637/2464 cut-off events. [2024-11-19 05:58:58,431 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-11-19 05:58:58,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3587 conditions, 2464 events. 637/2464 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 19432 event pairs, 297 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 2475. Up to 452 conditions per place. [2024-11-19 05:58:58,448 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 27 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2024-11-19 05:58:58,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 207 transitions, 488 flow [2024-11-19 05:58:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-11-19 05:58:58,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2024-11-19 05:58:58,450 INFO L175 Difference]: Start difference. First operand has 206 places, 199 transitions, 412 flow. Second operand 3 states and 650 transitions. [2024-11-19 05:58:58,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 207 transitions, 488 flow [2024-11-19 05:58:58,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:58,453 INFO L231 Difference]: Finished difference. Result has 205 places, 198 transitions, 408 flow [2024-11-19 05:58:58,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=205, PETRI_TRANSITIONS=198} [2024-11-19 05:58:58,454 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places. [2024-11-19 05:58:58,455 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 198 transitions, 408 flow [2024-11-19 05:58:58,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 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-19 05:58:58,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:58,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:58,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:58:58,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:58,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2117028161, now seen corresponding path program 1 times [2024-11-19 05:58:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124674795] [2024-11-19 05:58:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:58,493 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-19 05:58:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:58,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124674795] [2024-11-19 05:58:58,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124674795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:58,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:58,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:58,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236350377] [2024-11-19 05:58:58,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:58,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:58,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:58,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 235 [2024-11-19 05:58:58,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 198 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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-19 05:58:58,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:58,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 235 [2024-11-19 05:58:58,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:58,737 INFO L124 PetriNetUnfolderBase]: 779/3277 cut-off events. [2024-11-19 05:58:58,737 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-19 05:58:58,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 3277 events. 779/3277 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 27715 event pairs, 515 based on Foata normal form. 0/2870 useless extension candidates. Maximal degree in co-relation 3688. Up to 796 conditions per place. [2024-11-19 05:58:58,754 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 28 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-11-19 05:58:58,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 487 flow [2024-11-19 05:58:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2024-11-19 05:58:58,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9163120567375886 [2024-11-19 05:58:58,757 INFO L175 Difference]: Start difference. First operand has 205 places, 198 transitions, 408 flow. Second operand 3 states and 646 transitions. [2024-11-19 05:58:58,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 487 flow [2024-11-19 05:58:58,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:58,760 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 409 flow [2024-11-19 05:58:58,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=409, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2024-11-19 05:58:58,762 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places. [2024-11-19 05:58:58,763 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 409 flow [2024-11-19 05:58:58,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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-19 05:58:58,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:58,763 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] [2024-11-19 05:58:58,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:58:58,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2024-11-19 05:58:58,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash 707989954, now seen corresponding path program 1 times [2024-11-19 05:58:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603404080] [2024-11-19 05:58:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:58,792 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-19 05:58:58,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:58,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603404080] [2024-11-19 05:58:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603404080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:58,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408954452] [2024-11-19 05:58:58,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:58,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:58,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 235 [2024-11-19 05:58:58,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-19 05:58:58,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:58,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 235 [2024-11-19 05:58:58,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:58,985 INFO L124 PetriNetUnfolderBase]: 617/2919 cut-off events. [2024-11-19 05:58:58,985 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-19 05:58:58,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 2919 events. 617/2919 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 24348 event pairs, 272 based on Foata normal form. 0/2600 useless extension candidates. Maximal degree in co-relation 3129. Up to 433 conditions per place. [2024-11-19 05:58:58,997 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 0 selfloop transitions, 0 changer transitions 205/205 dead transitions. [2024-11-19 05:58:58,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 205 transitions, 484 flow [2024-11-19 05:58:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2024-11-19 05:58:58,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9219858156028369 [2024-11-19 05:58:58,998 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 409 flow. Second operand 3 states and 650 transitions. [2024-11-19 05:58:58,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 205 transitions, 484 flow [2024-11-19 05:58:58,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 205 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:59,000 INFO L231 Difference]: Finished difference. Result has 204 places, 0 transitions, 0 flow [2024-11-19 05:58:59,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=204, PETRI_TRANSITIONS=0} [2024-11-19 05:58:59,001 INFO L277 CegarLoopForPetriNet]: 219 programPoint places, -15 predicate places. [2024-11-19 05:58:59,001 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 0 transitions, 0 flow [2024-11-19 05:58:59,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-19 05:58:59,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 24 remaining) [2024-11-19 05:58:59,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2024-11-19 05:58:59,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2024-11-19 05:58:59,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2024-11-19 05:58:59,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2024-11-19 05:58:59,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2024-11-19 05:58:59,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 24 remaining) [2024-11-19 05:58:59,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2024-11-19 05:58:59,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2024-11-19 05:58:59,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2024-11-19 05:58:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:58:59,009 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:59,017 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:58:59,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:58:59,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:58:59 BasicIcfg [2024-11-19 05:58:59,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:58:59,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:58:59,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:58:59,021 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:58:59,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:54" (3/4) ... [2024-11-19 05:58:59,023 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:58:59,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:58:59,026 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:58:59,027 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:58:59,027 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-19 05:58:59,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-19 05:58:59,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:58:59,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 05:58:59,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:58:59,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:58:59,107 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:58:59,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:58:59,107 INFO L158 Benchmark]: Toolchain (without parser) took 5715.95ms. Allocated memory was 161.5MB in the beginning and 692.1MB in the end (delta: 530.6MB). Free memory was 93.3MB in the beginning and 283.3MB in the end (delta: -190.0MB). Peak memory consumption was 341.7MB. Max. memory is 16.1GB. [2024-11-19 05:58:59,107 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 79.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:58:59,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.22ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 79.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 05:58:59,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 161.5MB. Free memory was 79.7MB in the beginning and 77.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:59,108 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 161.5MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:58:59,108 INFO L158 Benchmark]: RCFGBuilder took 469.72ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 125.5MB in the end (delta: -49.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 05:58:59,108 INFO L158 Benchmark]: TraceAbstraction took 4880.68ms. Allocated memory was 161.5MB in the beginning and 692.1MB in the end (delta: 530.6MB). Free memory was 124.7MB in the beginning and 288.5MB in the end (delta: -163.9MB). Peak memory consumption was 369.3MB. Max. memory is 16.1GB. [2024-11-19 05:58:59,110 INFO L158 Benchmark]: Witness Printer took 85.49ms. Allocated memory is still 692.1MB. Free memory was 288.5MB in the beginning and 283.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:58:59,111 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.17ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 79.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.22ms. Allocated memory is still 161.5MB. Free memory was 93.1MB in the beginning and 79.7MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 161.5MB. Free memory was 79.7MB in the beginning and 77.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 161.5MB. Free memory was 77.4MB in the beginning and 75.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 469.72ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 125.5MB in the end (delta: -49.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4880.68ms. Allocated memory was 161.5MB in the beginning and 692.1MB in the end (delta: 530.6MB). Free memory was 124.7MB in the beginning and 288.5MB in the end (delta: -163.9MB). Peak memory consumption was 369.3MB. Max. memory is 16.1GB. * Witness Printer took 85.49ms. Allocated memory is still 692.1MB. Free memory was 288.5MB in the beginning and 283.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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 9 procedures, 335 locations, 24 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: 4.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 605 IncrementalHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 30 mSDtfsCounter, 605 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=0, InterpolantAutomatonStates: 36, 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, 0.4s InterpolantComputationTime, 912 NumberOfCodeBlocks, 912 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:58:59,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE