./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f 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/goblint-regression/10-synch_02-thread_nonunique.i -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 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:31:48,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:31:48,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:31:48,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:31:48,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:31:48,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:31:48,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:31:48,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:31:48,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:31:48,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:31:48,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:31:48,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:31:48,228 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:31:48,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:31:48,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:31:48,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:31:48,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:31:48,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:31:48,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:31:48,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:31:48,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:31:48,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:31:48,230 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:31:48,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:31:48,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:31:48,231 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:31:48,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:31:48,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:31:48,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:31:48,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:31:48,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:31:48,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:31:48,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:31:48,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:31:48,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:31:48,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:31:48,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:31:48,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:31:48,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:31:48,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:31:48,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:31:48,234 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 -> 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba [2024-11-12 12:31:48,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:31:48,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:31:48,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:31:48,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:31:48,440 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:31:48,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-11-12 12:31:49,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:31:49,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:31:49,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/10-synch_02-thread_nonunique.i [2024-11-12 12:31:49,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db29481a/a642860844f241aabf5abffa814cf0a9/FLAGbc3b63a57 [2024-11-12 12:31:50,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db29481a/a642860844f241aabf5abffa814cf0a9 [2024-11-12 12:31:50,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:31:50,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:31:50,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:31:50,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:31:50,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:31:50,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526ada0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50, skipping insertion in model container [2024-11-12 12:31:50,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:31:50,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:31:50,611 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:31:50,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:31:50,730 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:31:50,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50 WrapperNode [2024-11-12 12:31:50,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:31:50,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:31:50,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:31:50,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:31:50,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,752 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,772 INFO L138 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-11-12 12:31:50,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:31:50,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:31:50,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:31:50,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:31:50,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:31:50,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:31:50,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:31:50,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:31:50,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (1/1) ... [2024-11-12 12:31:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:31:50,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:31:50,834 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-12 12:31:50,836 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-12 12:31:50,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:31:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:31:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:31:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:31:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-12 12:31:50,869 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-12 12:31:50,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:31:50,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:31:50,871 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:31:50,970 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:31:50,972 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:31:51,055 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:31:51,056 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:31:51,065 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:31:51,065 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 12:31:51,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:31:51 BoogieIcfgContainer [2024-11-12 12:31:51,065 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:31:51,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:31:51,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:31:51,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:31:51,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:31:50" (1/3) ... [2024-11-12 12:31:51,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76baf06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:31:51, skipping insertion in model container [2024-11-12 12:31:51,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:31:50" (2/3) ... [2024-11-12 12:31:51,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76baf06e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:31:51, skipping insertion in model container [2024-11-12 12:31:51,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:31:51" (3/3) ... [2024-11-12 12:31:51,073 INFO L112 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2024-11-12 12:31:51,087 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:31:51,087 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-12 12:31:51,087 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:31:51,126 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-12 12:31:51,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 119 flow [2024-11-12 12:31:51,188 INFO L124 PetriNetUnfolderBase]: 5/86 cut-off events. [2024-11-12 12:31:51,188 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:31:51,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 86 events. 5/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 42. Up to 4 conditions per place. [2024-11-12 12:31:51,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 56 transitions, 119 flow [2024-11-12 12:31:51,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 56 transitions, 119 flow [2024-11-12 12:31:51,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:31:51,208 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;@42f8e18a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:31:51,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-12 12:31:51,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:31:51,219 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-12 12:31:51,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:31:51,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:51,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:51,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-12 12:31:51,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash -556190281, now seen corresponding path program 1 times [2024-11-12 12:31:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795308826] [2024-11-12 12:31:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:51,469 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-12 12:31:51,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:51,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795308826] [2024-11-12 12:31:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795308826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:31:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283951218] [2024-11-12 12:31:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:31:51,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:51,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:31:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:31:51,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 56 [2024-11-12 12:31:51,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-12 12:31:51,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:51,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 56 [2024-11-12 12:31:51,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:51,604 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2024-11-12 12:31:51,604 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:31:51,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 0/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-11-12 12:31:51,605 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 5 selfloop transitions, 4 changer transitions 7/54 dead transitions. [2024-11-12 12:31:51,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 137 flow [2024-11-12 12:31:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:31:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:31:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-11-12 12:31:51,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2024-11-12 12:31:51,618 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 119 flow. Second operand 3 states and 146 transitions. [2024-11-12 12:31:51,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 137 flow [2024-11-12 12:31:51,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:31:51,627 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 115 flow [2024-11-12 12:31:51,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2024-11-12 12:31:51,632 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2024-11-12 12:31:51,633 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 115 flow [2024-11-12 12:31:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-12 12:31:51,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:51,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:31:51,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-12 12:31:51,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2059474795, now seen corresponding path program 1 times [2024-11-12 12:31:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:51,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673695242] [2024-11-12 12:31:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:52,016 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-12 12:31:52,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673695242] [2024-11-12 12:31:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673695242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:52,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:31:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85249920] [2024-11-12 12:31:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:52,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:31:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:31:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:31:52,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 56 [2024-11-12 12:31:52,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 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-12 12:31:52,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:52,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 56 [2024-11-12 12:31:52,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:52,156 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2024-11-12 12:31:52,156 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-12 12:31:52,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 64 events. 0/64 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2024-11-12 12:31:52,157 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 15 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2024-11-12 12:31:52,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 153 flow [2024-11-12 12:31:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:31:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:31:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2024-11-12 12:31:52,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2024-11-12 12:31:52,162 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 115 flow. Second operand 6 states and 207 transitions. [2024-11-12 12:31:52,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 153 flow [2024-11-12 12:31:52,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:31:52,164 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2024-11-12 12:31:52,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-11-12 12:31:52,164 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2024-11-12 12:31:52,165 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2024-11-12 12:31:52,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 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-12 12:31:52,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:31:52,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-12 12:31:52,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1180462258, now seen corresponding path program 1 times [2024-11-12 12:31:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577109908] [2024-11-12 12:31:52,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:52,194 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-12 12:31:52,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577109908] [2024-11-12 12:31:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577109908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:52,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:52,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:31:52,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723806384] [2024-11-12 12:31:52,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:52,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:31:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:52,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:31:52,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:31:52,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 56 [2024-11-12 12:31:52,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-12 12:31:52,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:52,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 56 [2024-11-12 12:31:52,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:52,220 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2024-11-12 12:31:52,220 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2024-11-12 12:31:52,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 63 events. 0/63 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2024-11-12 12:31:52,221 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-11-12 12:31:52,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 125 flow [2024-11-12 12:31:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:31:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:31:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-11-12 12:31:52,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2024-11-12 12:31:52,224 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 148 transitions. [2024-11-12 12:31:52,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 125 flow [2024-11-12 12:31:52,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 115 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:31:52,226 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 107 flow [2024-11-12 12:31:52,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2024-11-12 12:31:52,227 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2024-11-12 12:31:52,227 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 107 flow [2024-11-12 12:31:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-12 12:31:52,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:31:52,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-12 12:31:52,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1951054593, now seen corresponding path program 1 times [2024-11-12 12:31:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068059563] [2024-11-12 12:31:52,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:52,304 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-12 12:31:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068059563] [2024-11-12 12:31:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068059563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:52,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:31:52,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200081167] [2024-11-12 12:31:52,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:52,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:31:52,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:31:52,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:31:52,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 56 [2024-11-12 12:31:52,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-12 12:31:52,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:52,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 56 [2024-11-12 12:31:52,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:52,387 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-11-12 12:31:52,389 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:31:52,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 0/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2024-11-12 12:31:52,390 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 3 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2024-11-12 12:31:52,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2024-11-12 12:31:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:31:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:31:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 254 transitions. [2024-11-12 12:31:52,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559523809523809 [2024-11-12 12:31:52,393 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 107 flow. Second operand 6 states and 254 transitions. [2024-11-12 12:31:52,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2024-11-12 12:31:52,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-12 12:31:52,394 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 74 flow [2024-11-12 12:31:52,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-11-12 12:31:52,395 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2024-11-12 12:31:52,396 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 74 flow [2024-11-12 12:31:52,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 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-12 12:31:52,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,396 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:31:52,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-12 12:31:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 145983485, now seen corresponding path program 1 times [2024-11-12 12:31:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500970498] [2024-11-12 12:31:52,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:31:52,422 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:31:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:31:52,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:31:52,449 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:31:52,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-12 12:31:52,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-11-12 12:31:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-11-12 12:31:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-11-12 12:31:52,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-11-12 12:31:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:31:52,452 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 12:31:52,454 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-12 12:31:52,454 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-12 12:31:52,462 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:31:52,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 150 flow [2024-11-12 12:31:52,483 INFO L124 PetriNetUnfolderBase]: 10/154 cut-off events. [2024-11-12 12:31:52,487 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:31:52,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 154 events. 10/154 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 300 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 88. Up to 8 conditions per place. [2024-11-12 12:31:52,490 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 67 transitions, 150 flow [2024-11-12 12:31:52,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 150 flow [2024-11-12 12:31:52,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:31:52,493 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;@42f8e18a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:31:52,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-12 12:31:52,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:31:52,498 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-12 12:31:52,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:31:52,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 12:31:52,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1225650938, now seen corresponding path program 1 times [2024-11-12 12:31:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025330711] [2024-11-12 12:31:52,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:52,533 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-12 12:31:52,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025330711] [2024-11-12 12:31:52,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025330711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:52,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:52,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:31:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853085194] [2024-11-12 12:31:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:52,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:31:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:52,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:31:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:31:52,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 67 [2024-11-12 12:31:52,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-12 12:31:52,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:52,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 67 [2024-11-12 12:31:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:52,603 INFO L124 PetriNetUnfolderBase]: 2/149 cut-off events. [2024-11-12 12:31:52,604 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-12 12:31:52,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 2/149 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 329 event pairs, 0 based on Foata normal form. 3/142 useless extension candidates. Maximal degree in co-relation 36. Up to 20 conditions per place. [2024-11-12 12:31:52,604 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 13 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-12 12:31:52,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 194 flow [2024-11-12 12:31:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:31:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:31:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2024-11-12 12:31:52,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905472636815921 [2024-11-12 12:31:52,607 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 150 flow. Second operand 3 states and 179 transitions. [2024-11-12 12:31:52,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 194 flow [2024-11-12 12:31:52,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:31:52,609 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 170 flow [2024-11-12 12:31:52,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2024-11-12 12:31:52,610 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-12 12:31:52,610 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 170 flow [2024-11-12 12:31:52,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-12 12:31:52,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:31:52,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 12:31:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1637995509, now seen corresponding path program 1 times [2024-11-12 12:31:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135665103] [2024-11-12 12:31:52,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:31:52,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:52,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135665103] [2024-11-12 12:31:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135665103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:52,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:31:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825368122] [2024-11-12 12:31:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:31:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:31:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:31:52,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2024-11-12 12:31:52,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 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-12 12:31:52,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:52,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2024-11-12 12:31:52,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:52,886 INFO L124 PetriNetUnfolderBase]: 2/146 cut-off events. [2024-11-12 12:31:52,886 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-12 12:31:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 146 events. 2/146 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 319 event pairs, 1 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 45. Up to 52 conditions per place. [2024-11-12 12:31:52,887 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 20 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2024-11-12 12:31:52,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 220 flow [2024-11-12 12:31:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:31:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:31:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2024-11-12 12:31:52,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6592039800995025 [2024-11-12 12:31:52,888 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 170 flow. Second operand 6 states and 265 transitions. [2024-11-12 12:31:52,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 220 flow [2024-11-12 12:31:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:31:52,890 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 176 flow [2024-11-12 12:31:52,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2024-11-12 12:31:52,890 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-12 12:31:52,891 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 176 flow [2024-11-12 12:31:52,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 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-12 12:31:52,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:31:52,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 12:31:52,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash -121608859, now seen corresponding path program 1 times [2024-11-12 12:31:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998495872] [2024-11-12 12:31:52,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:52,909 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-12 12:31:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998495872] [2024-11-12 12:31:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998495872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:52,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:31:52,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257114856] [2024-11-12 12:31:52,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:52,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:31:52,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:31:52,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:31:52,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 67 [2024-11-12 12:31:52,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-12 12:31:52,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:52,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 67 [2024-11-12 12:31:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:52,944 INFO L124 PetriNetUnfolderBase]: 18/301 cut-off events. [2024-11-12 12:31:52,944 INFO L125 PetriNetUnfolderBase]: For 69/98 co-relation queries the response was YES. [2024-11-12 12:31:52,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 301 events. 18/301 cut-off events. For 69/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1409 event pairs, 8 based on Foata normal form. 3/276 useless extension candidates. Maximal degree in co-relation 174. Up to 34 conditions per place. [2024-11-12 12:31:52,946 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 11 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-11-12 12:31:52,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 224 flow [2024-11-12 12:31:52,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:31:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:31:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-11-12 12:31:52,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900497512437811 [2024-11-12 12:31:52,947 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 176 flow. Second operand 3 states and 181 transitions. [2024-11-12 12:31:52,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 224 flow [2024-11-12 12:31:52,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:31:52,949 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 194 flow [2024-11-12 12:31:52,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-11-12 12:31:52,950 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2024-11-12 12:31:52,950 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 194 flow [2024-11-12 12:31:52,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-12 12:31:52,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:52,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:52,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:31:52,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 12:31:52,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1349972437, now seen corresponding path program 1 times [2024-11-12 12:31:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59801754] [2024-11-12 12:31:52,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:53,005 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-12 12:31:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59801754] [2024-11-12 12:31:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59801754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:31:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046211872] [2024-11-12 12:31:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:53,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:31:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:53,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:31:53,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:31:53,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 67 [2024-11-12 12:31:53,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 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-12 12:31:53,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:53,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 67 [2024-11-12 12:31:53,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:53,121 INFO L124 PetriNetUnfolderBase]: 4/210 cut-off events. [2024-11-12 12:31:53,122 INFO L125 PetriNetUnfolderBase]: For 41/46 co-relation queries the response was YES. [2024-11-12 12:31:53,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 210 events. 4/210 cut-off events. For 41/46 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 721 event pairs, 1 based on Foata normal form. 3/199 useless extension candidates. Maximal degree in co-relation 167. Up to 26 conditions per place. [2024-11-12 12:31:53,123 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 14 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2024-11-12 12:31:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 250 flow [2024-11-12 12:31:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:31:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:31:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2024-11-12 12:31:53,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8009950248756219 [2024-11-12 12:31:53,126 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 194 flow. Second operand 6 states and 322 transitions. [2024-11-12 12:31:53,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 250 flow [2024-11-12 12:31:53,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:31:53,129 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 218 flow [2024-11-12 12:31:53,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2024-11-12 12:31:53,131 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2024-11-12 12:31:53,131 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 218 flow [2024-11-12 12:31:53,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 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-12 12:31:53,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:53,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:53,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:31:53,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 12:31:53,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash 99772284, now seen corresponding path program 1 times [2024-11-12 12:31:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:53,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200565143] [2024-11-12 12:31:53,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:53,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:31:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:31:53,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:31:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200565143] [2024-11-12 12:31:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200565143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:31:53,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:31:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:31:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317749444] [2024-11-12 12:31:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:31:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:31:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:31:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:31:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:31:53,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 67 [2024-11-12 12:31:53,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-12 12:31:53,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:31:53,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 67 [2024-11-12 12:31:53,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:31:53,216 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-11-12 12:31:53,217 INFO L125 PetriNetUnfolderBase]: For 93/190 co-relation queries the response was YES. [2024-11-12 12:31:53,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 311 events. 18/311 cut-off events. For 93/190 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1483 event pairs, 9 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 397. Up to 37 conditions per place. [2024-11-12 12:31:53,219 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 10 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-12 12:31:53,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 261 flow [2024-11-12 12:31:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:31:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:31:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2024-11-12 12:31:53,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8955223880597015 [2024-11-12 12:31:53,221 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 218 flow. Second operand 3 states and 180 transitions. [2024-11-12 12:31:53,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 261 flow [2024-11-12 12:31:53,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 251 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-12 12:31:53,224 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 244 flow [2024-11-12 12:31:53,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2024-11-12 12:31:53,225 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2024-11-12 12:31:53,227 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 244 flow [2024-11-12 12:31:53,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-12 12:31:53,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:31:53,227 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:31:53,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:31:53,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-12 12:31:53,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:31:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1517586101, now seen corresponding path program 1 times [2024-11-12 12:31:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:31:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371298833] [2024-11-12 12:31:53,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:31:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:31:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:31:53,244 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 12:31:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 12:31:53,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 12:31:53,252 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 12:31:53,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2024-11-12 12:31:53,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-12 12:31:53,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-12 12:31:53,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-12 12:31:53,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-12 12:31:53,253 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-12 12:31:53,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:31:53,253 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 12:31:53,282 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-12 12:31:53,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:31:53,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:31:53 BasicIcfg [2024-11-12 12:31:53,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:31:53,287 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:31:53,287 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:31:53,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:31:53,288 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:31:51" (3/4) ... [2024-11-12 12:31:53,289 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-12 12:31:53,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:31:53,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:31:53,324 INFO L158 Benchmark]: Toolchain (without parser) took 3096.55ms. Allocated memory was 142.6MB in the beginning and 247.5MB in the end (delta: 104.9MB). Free memory was 87.3MB in the beginning and 146.8MB in the end (delta: -59.5MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2024-11-12 12:31:53,324 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:31:53,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.66ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 87.3MB in the beginning and 167.9MB in the end (delta: -80.6MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-12 12:31:53,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.76ms. Allocated memory is still 205.5MB. Free memory was 167.9MB in the beginning and 165.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:31:53,325 INFO L158 Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 205.5MB. Free memory was 165.8MB in the beginning and 164.8MB in the end (delta: 987.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:31:53,327 INFO L158 Benchmark]: RCFGBuilder took 259.86ms. Allocated memory is still 205.5MB. Free memory was 164.8MB in the beginning and 151.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:31:53,328 INFO L158 Benchmark]: TraceAbstraction took 2219.81ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 150.1MB in the beginning and 151.0MB in the end (delta: -840.4kB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-12 12:31:53,328 INFO L158 Benchmark]: Witness Printer took 36.60ms. Allocated memory is still 247.5MB. Free memory was 151.0MB in the beginning and 146.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:31:53,329 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 142.6MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.66ms. Allocated memory was 142.6MB in the beginning and 205.5MB in the end (delta: 62.9MB). Free memory was 87.3MB in the beginning and 167.9MB in the end (delta: -80.6MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.76ms. Allocated memory is still 205.5MB. Free memory was 167.9MB in the beginning and 165.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.18ms. Allocated memory is still 205.5MB. Free memory was 165.8MB in the beginning and 164.8MB in the end (delta: 987.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 259.86ms. Allocated memory is still 205.5MB. Free memory was 164.8MB in the beginning and 151.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2219.81ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 150.1MB in the beginning and 151.0MB in the end (delta: -840.4kB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 36.60ms. Allocated memory is still 247.5MB. Free memory was 151.0MB in the beginning and 146.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal=0] [L923] 0 pthread_t id[10]; VAL [id={8:0}, myglobal=0] [L924] 0 int i; VAL [id={8:0}, myglobal=0] [L925] 0 i=0 VAL [i=0, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [i=0, id={8:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [i=0, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=0, id={8:0}, myglobal=0] [L925] 0 i++ VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, i=1, id={8:0}, myglobal=0] [L919] 2 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] [L919] 1 myglobal=42 VAL [\old(arg)={0:0}, arg={0:0}, myglobal=42] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] and C: myglobal=42 [919] - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 64 locations, 5 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: 1.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 36 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 18, 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.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 74 locations, 6 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: 0.8s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 22 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=5, InterpolantAutomatonStates: 21, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-12 12:31:53,352 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE