./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/pthread-divine/condvar.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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 17:46:58,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 17:46:58,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-22 17:46:58,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 17:46:58,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 17:46:58,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 17:46:58,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 17:46:58,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 17:46:58,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 17:46:58,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 17:46:58,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 17:46:58,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 17:46:58,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 17:46:58,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 17:46:58,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 17:46:58,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 17:46:58,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 17:46:58,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 17:46:58,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 17:46:58,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 17:46:58,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 17:46:58,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 17:46:58,298 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 17:46:58,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 17:46:58,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 17:46:58,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 17:46:58,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 17:46:58,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 17:46:58,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 17:46:58,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 17:46:58,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 17:46:58,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 17:46:58,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 17:46:58,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 17:46:58,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 17:46:58,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 17:46:58,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 17:46:58,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 17:46:58,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 17:46:58,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 17:46:58,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 17:46:58,304 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2024-11-22 17:46:58,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 17:46:58,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 17:46:58,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 17:46:58,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 17:46:58,607 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 17:46:58,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/condvar.i [2024-11-22 17:47:00,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 17:47:00,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 17:47:00,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2024-11-22 17:47:00,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b439dda92/c8fcb5b2e49d49f9a812d7952c44008a/FLAGada777f66 [2024-11-22 17:47:00,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b439dda92/c8fcb5b2e49d49f9a812d7952c44008a [2024-11-22 17:47:00,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 17:47:00,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 17:47:00,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 17:47:00,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 17:47:00,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 17:47:00,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b595aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00, skipping insertion in model container [2024-11-22 17:47:00,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 17:47:00,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 17:47:00,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 17:47:00,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 17:47:00,794 INFO L204 MainTranslator]: Completed translation [2024-11-22 17:47:00,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00 WrapperNode [2024-11-22 17:47:00,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 17:47:00,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 17:47:00,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 17:47:00,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 17:47:00,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,845 INFO L138 Inliner]: procedures = 168, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 180 [2024-11-22 17:47:00,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 17:47:00,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 17:47:00,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 17:47:00,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 17:47:00,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 17:47:00,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 17:47:00,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 17:47:00,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 17:47:00,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (1/1) ... [2024-11-22 17:47:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 17:47:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:00,929 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-22 17:47:00,931 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-22 17:47:00,976 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 17:47:00,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 17:47:00,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 17:47:00,977 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-22 17:47:00,977 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-22 17:47:00,977 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 17:47:00,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 17:47:00,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 17:47:00,980 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 17:47:01,140 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 17:47:01,143 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 17:47:01,398 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 17:47:01,398 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 17:47:01,430 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 17:47:01,434 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 17:47:01,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:47:01 BoogieIcfgContainer [2024-11-22 17:47:01,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 17:47:01,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 17:47:01,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 17:47:01,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 17:47:01,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:47:00" (1/3) ... [2024-11-22 17:47:01,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcef79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:47:01, skipping insertion in model container [2024-11-22 17:47:01,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:47:00" (2/3) ... [2024-11-22 17:47:01,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcef79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:47:01, skipping insertion in model container [2024-11-22 17:47:01,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:47:01" (3/3) ... [2024-11-22 17:47:01,444 INFO L112 eAbstractionObserver]: Analyzing ICFG condvar.i [2024-11-22 17:47:01,459 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 17:47:01,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-22 17:47:01,460 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 17:47:01,513 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-22 17:47:01,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 187 transitions, 381 flow [2024-11-22 17:47:01,621 INFO L124 PetriNetUnfolderBase]: 6/186 cut-off events. [2024-11-22 17:47:01,621 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 17:47:01,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 121 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-11-22 17:47:01,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 187 transitions, 381 flow [2024-11-22 17:47:01,633 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 182 transitions, 367 flow [2024-11-22 17:47:01,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 17:47:01,653 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;@3d902405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 17:47:01,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 17:47:01,696 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 17:47:01,699 INFO L124 PetriNetUnfolderBase]: 1/149 cut-off events. [2024-11-22 17:47:01,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:47:01,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:01,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:01,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:01,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:01,712 INFO L85 PathProgramCache]: Analyzing trace with hash -2112555345, now seen corresponding path program 1 times [2024-11-22 17:47:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309391001] [2024-11-22 17:47:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:01,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:02,173 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-22 17:47:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:02,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309391001] [2024-11-22 17:47:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309391001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:47:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:47:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:47:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185602943] [2024-11-22 17:47:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:47:02,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:47:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:02,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:47:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:47:02,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 187 [2024-11-22 17:47:02,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 182 transitions, 367 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-22 17:47:02,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:02,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 187 [2024-11-22 17:47:02,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:02,315 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2024-11-22 17:47:02,315 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 17:47:02,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 220 events. 9/220 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 302 event pairs, 1 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2024-11-22 17:47:02,321 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 12 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2024-11-22 17:47:02,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 399 flow [2024-11-22 17:47:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:47:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:47:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2024-11-22 17:47:02,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9679144385026738 [2024-11-22 17:47:02,344 INFO L175 Difference]: Start difference. First operand has 180 places, 182 transitions, 367 flow. Second operand 3 states and 543 transitions. [2024-11-22 17:47:02,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 399 flow [2024-11-22 17:47:02,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 183 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:47:02,354 INFO L231 Difference]: Finished difference. Result has 182 places, 180 transitions, 382 flow [2024-11-22 17:47:02,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=182, PETRI_TRANSITIONS=180} [2024-11-22 17:47:02,361 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 2 predicate places. [2024-11-22 17:47:02,362 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 180 transitions, 382 flow [2024-11-22 17:47:02,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-22 17:47:02,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:02,362 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:02,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 17:47:02,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:02,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1781577573, now seen corresponding path program 1 times [2024-11-22 17:47:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597388836] [2024-11-22 17:47:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:02,666 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-22 17:47:02,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:02,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597388836] [2024-11-22 17:47:02,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597388836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:47:02,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:47:02,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:47:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073269377] [2024-11-22 17:47:02,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:47:02,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:47:02,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:02,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:47:02,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:47:02,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 187 [2024-11-22 17:47:02,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 180 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-22 17:47:02,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:02,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 187 [2024-11-22 17:47:02,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:02,780 INFO L124 PetriNetUnfolderBase]: 33/377 cut-off events. [2024-11-22 17:47:02,780 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 17:47:02,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 377 events. 33/377 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1319 event pairs, 6 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 346. Up to 39 conditions per place. [2024-11-22 17:47:02,783 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 14 selfloop transitions, 4 changer transitions 0/187 dead transitions. [2024-11-22 17:47:02,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 187 transitions, 432 flow [2024-11-22 17:47:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:47:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:47:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2024-11-22 17:47:02,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9429590017825312 [2024-11-22 17:47:02,786 INFO L175 Difference]: Start difference. First operand has 182 places, 180 transitions, 382 flow. Second operand 3 states and 529 transitions. [2024-11-22 17:47:02,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 187 transitions, 432 flow [2024-11-22 17:47:02,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 187 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:47:02,791 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 406 flow [2024-11-22 17:47:02,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2024-11-22 17:47:02,792 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 4 predicate places. [2024-11-22 17:47:02,792 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 406 flow [2024-11-22 17:47:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-22 17:47:02,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:02,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 17:47:02,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash -980043813, now seen corresponding path program 1 times [2024-11-22 17:47:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187443664] [2024-11-22 17:47:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:02,905 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-22 17:47:02,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:02,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187443664] [2024-11-22 17:47:02,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187443664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:47:02,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:47:02,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:47:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411096549] [2024-11-22 17:47:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:47:02,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:47:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:47:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:47:02,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 187 [2024-11-22 17:47:02,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-22 17:47:02,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:02,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 187 [2024-11-22 17:47:02,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:02,973 INFO L124 PetriNetUnfolderBase]: 23/349 cut-off events. [2024-11-22 17:47:02,973 INFO L125 PetriNetUnfolderBase]: For 28/30 co-relation queries the response was YES. [2024-11-22 17:47:02,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 349 events. 23/349 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1130 event pairs, 4 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 337. Up to 27 conditions per place. [2024-11-22 17:47:02,977 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 9 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2024-11-22 17:47:02,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 186 transitions, 442 flow [2024-11-22 17:47:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:47:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:47:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2024-11-22 17:47:02,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948306595365419 [2024-11-22 17:47:02,981 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 406 flow. Second operand 3 states and 532 transitions. [2024-11-22 17:47:02,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 186 transitions, 442 flow [2024-11-22 17:47:02,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 186 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:47:02,988 INFO L231 Difference]: Finished difference. Result has 186 places, 185 transitions, 426 flow [2024-11-22 17:47:02,990 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=186, PETRI_TRANSITIONS=185} [2024-11-22 17:47:02,990 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 6 predicate places. [2024-11-22 17:47:02,991 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 185 transitions, 426 flow [2024-11-22 17:47:02,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-22 17:47:02,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:02,992 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:02,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 17:47:02,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:02,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 691977945, now seen corresponding path program 1 times [2024-11-22 17:47:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739599816] [2024-11-22 17:47:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:03,172 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-22 17:47:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739599816] [2024-11-22 17:47:03,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739599816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:47:03,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:47:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 17:47:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331435033] [2024-11-22 17:47:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:47:03,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:47:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:47:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:47:03,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 187 [2024-11-22 17:47:03,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 185 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-22 17:47:03,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:03,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 187 [2024-11-22 17:47:03,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:03,315 INFO L124 PetriNetUnfolderBase]: 58/501 cut-off events. [2024-11-22 17:47:03,315 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2024-11-22 17:47:03,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 501 events. 58/501 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2320 event pairs, 6 based on Foata normal form. 5/460 useless extension candidates. Maximal degree in co-relation 598. Up to 76 conditions per place. [2024-11-22 17:47:03,319 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 13 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2024-11-22 17:47:03,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 466 flow [2024-11-22 17:47:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:47:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:47:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2024-11-22 17:47:03,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9429590017825312 [2024-11-22 17:47:03,322 INFO L175 Difference]: Start difference. First operand has 186 places, 185 transitions, 426 flow. Second operand 3 states and 529 transitions. [2024-11-22 17:47:03,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 466 flow [2024-11-22 17:47:03,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:47:03,329 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 430 flow [2024-11-22 17:47:03,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2024-11-22 17:47:03,332 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2024-11-22 17:47:03,332 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 430 flow [2024-11-22 17:47:03,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-22 17:47:03,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:03,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:03,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 17:47:03,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:03,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1443863732, now seen corresponding path program 1 times [2024-11-22 17:47:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099333191] [2024-11-22 17:47:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:03,521 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-22 17:47:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:03,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099333191] [2024-11-22 17:47:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099333191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:47:03,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:47:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 17:47:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465527692] [2024-11-22 17:47:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:47:03,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:47:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:47:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:47:03,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 187 [2024-11-22 17:47:03,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-22 17:47:03,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:03,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 187 [2024-11-22 17:47:03,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:03,582 INFO L124 PetriNetUnfolderBase]: 8/231 cut-off events. [2024-11-22 17:47:03,582 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 17:47:03,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 231 events. 8/231 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 302 event pairs, 0 based on Foata normal form. 1/219 useless extension candidates. Maximal degree in co-relation 185. Up to 14 conditions per place. [2024-11-22 17:47:03,584 INFO L140 encePairwiseOnDemand]: 184/187 looper letters, 9 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2024-11-22 17:47:03,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 183 transitions, 430 flow [2024-11-22 17:47:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:47:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:47:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2024-11-22 17:47:03,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9518716577540107 [2024-11-22 17:47:03,587 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 430 flow. Second operand 3 states and 534 transitions. [2024-11-22 17:47:03,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 183 transitions, 430 flow [2024-11-22 17:47:03,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 183 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-22 17:47:03,613 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 400 flow [2024-11-22 17:47:03,614 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2024-11-22 17:47:03,614 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 5 predicate places. [2024-11-22 17:47:03,615 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 400 flow [2024-11-22 17:47:03,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-22 17:47:03,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:03,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:03,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 17:47:03,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash 111066392, now seen corresponding path program 1 times [2024-11-22 17:47:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843907263] [2024-11-22 17:47:03,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843907263] [2024-11-22 17:47:03,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843907263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:47:03,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661113087] [2024-11-22 17:47:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:03,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:03,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:03,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:47:03,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 17:47:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:03,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 17:47:03,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:47:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 17:47:03,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 17:47:03,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661113087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:47:03,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 17:47:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-22 17:47:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116323068] [2024-11-22 17:47:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:47:03,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:47:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:47:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 17:47:03,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 187 [2024-11-22 17:47:03,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-22 17:47:03,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:03,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 187 [2024-11-22 17:47:03,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:04,017 INFO L124 PetriNetUnfolderBase]: 50/337 cut-off events. [2024-11-22 17:47:04,017 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-22 17:47:04,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 337 events. 50/337 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 915 event pairs, 15 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 357. Up to 70 conditions per place. [2024-11-22 17:47:04,019 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 14 selfloop transitions, 5 changer transitions 3/188 dead transitions. [2024-11-22 17:47:04,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 188 transitions, 464 flow [2024-11-22 17:47:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:47:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:47:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-11-22 17:47:04,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2024-11-22 17:47:04,022 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 400 flow. Second operand 3 states and 527 transitions. [2024-11-22 17:47:04,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 188 transitions, 464 flow [2024-11-22 17:47:04,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:47:04,026 INFO L231 Difference]: Finished difference. Result has 187 places, 182 transitions, 432 flow [2024-11-22 17:47:04,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=187, PETRI_TRANSITIONS=182} [2024-11-22 17:47:04,027 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 7 predicate places. [2024-11-22 17:47:04,027 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 432 flow [2024-11-22 17:47:04,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-22 17:47:04,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:04,028 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:04,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 17:47:04,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 17:47:04,229 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:04,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash 634368249, now seen corresponding path program 1 times [2024-11-22 17:47:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:04,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536394746] [2024-11-22 17:47:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:04,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:04,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536394746] [2024-11-22 17:47:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536394746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:47:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898870419] [2024-11-22 17:47:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:47:04,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:04,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:04,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:47:04,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 17:47:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:47:04,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 17:47:04,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:47:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:04,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:47:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898870419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:47:04,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:47:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-22 17:47:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009255170] [2024-11-22 17:47:04,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:47:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 17:47:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 17:47:04,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-22 17:47:04,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 187 [2024-11-22 17:47:04,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 432 flow. Second operand has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-22 17:47:04,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:04,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 187 [2024-11-22 17:47:04,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:04,861 INFO L124 PetriNetUnfolderBase]: 72/434 cut-off events. [2024-11-22 17:47:04,862 INFO L125 PetriNetUnfolderBase]: For 47/50 co-relation queries the response was YES. [2024-11-22 17:47:04,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 434 events. 72/434 cut-off events. For 47/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1198 event pairs, 9 based on Foata normal form. 8/428 useless extension candidates. Maximal degree in co-relation 580. Up to 47 conditions per place. [2024-11-22 17:47:04,866 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 34 selfloop transitions, 9 changer transitions 0/211 dead transitions. [2024-11-22 17:47:04,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 211 transitions, 578 flow [2024-11-22 17:47:04,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 17:47:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 17:47:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1557 transitions. [2024-11-22 17:47:04,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9251336898395722 [2024-11-22 17:47:04,870 INFO L175 Difference]: Start difference. First operand has 187 places, 182 transitions, 432 flow. Second operand 9 states and 1557 transitions. [2024-11-22 17:47:04,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 211 transitions, 578 flow [2024-11-22 17:47:04,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 211 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:47:04,876 INFO L231 Difference]: Finished difference. Result has 196 places, 188 transitions, 472 flow [2024-11-22 17:47:04,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=196, PETRI_TRANSITIONS=188} [2024-11-22 17:47:04,877 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 16 predicate places. [2024-11-22 17:47:04,878 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 188 transitions, 472 flow [2024-11-22 17:47:04,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 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-22 17:47:04,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:04,879 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:47:04,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 17:47:05,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-22 17:47:05,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1084192171, now seen corresponding path program 2 times [2024-11-22 17:47:05,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:05,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513876731] [2024-11-22 17:47:05,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 17:47:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:05,132 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 17:47:05,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:05,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:05,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513876731] [2024-11-22 17:47:05,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513876731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:47:05,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188109409] [2024-11-22 17:47:05,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 17:47:05,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:05,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:05,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:47:05,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 17:47:05,505 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 17:47:05,506 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:05,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 17:47:05,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:47:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:05,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:47:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188109409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:47:05,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:47:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-22 17:47:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711978554] [2024-11-22 17:47:05,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:47:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 17:47:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 17:47:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-22 17:47:05,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 187 [2024-11-22 17:47:05,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 188 transitions, 472 flow. Second operand has 18 states, 18 states have (on average 170.05555555555554) internal successors, (3061), 18 states have internal predecessors, (3061), 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-22 17:47:05,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:05,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 187 [2024-11-22 17:47:05,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:06,062 INFO L124 PetriNetUnfolderBase]: 109/597 cut-off events. [2024-11-22 17:47:06,062 INFO L125 PetriNetUnfolderBase]: For 144/147 co-relation queries the response was YES. [2024-11-22 17:47:06,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 597 events. 109/597 cut-off events. For 144/147 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1842 event pairs, 12 based on Foata normal form. 16/600 useless extension candidates. Maximal degree in co-relation 1046. Up to 47 conditions per place. [2024-11-22 17:47:06,066 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 74 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2024-11-22 17:47:06,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 263 transitions, 872 flow [2024-11-22 17:47:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 17:47:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-22 17:47:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3627 transitions. [2024-11-22 17:47:06,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9236058059587471 [2024-11-22 17:47:06,074 INFO L175 Difference]: Start difference. First operand has 196 places, 188 transitions, 472 flow. Second operand 21 states and 3627 transitions. [2024-11-22 17:47:06,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 263 transitions, 872 flow [2024-11-22 17:47:06,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 263 transitions, 858 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-22 17:47:06,079 INFO L231 Difference]: Finished difference. Result has 220 places, 201 transitions, 596 flow [2024-11-22 17:47:06,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=596, PETRI_PLACES=220, PETRI_TRANSITIONS=201} [2024-11-22 17:47:06,080 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 40 predicate places. [2024-11-22 17:47:06,080 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 201 transitions, 596 flow [2024-11-22 17:47:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 170.05555555555554) internal successors, (3061), 18 states have internal predecessors, (3061), 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-22 17:47:06,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:06,083 INFO L204 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:47:06,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 17:47:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:06,284 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2140334289, now seen corresponding path program 3 times [2024-11-22 17:47:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305386793] [2024-11-22 17:47:06,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 17:47:06,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:06,361 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-22 17:47:06,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:06,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305386793] [2024-11-22 17:47:06,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305386793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:47:06,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243283418] [2024-11-22 17:47:06,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 17:47:06,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:06,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:06,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:47:06,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 17:47:07,121 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-22 17:47:07,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:07,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 17:47:07,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:47:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:07,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:47:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243283418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:47:07,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:47:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 35 [2024-11-22 17:47:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716794296] [2024-11-22 17:47:07,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:47:07,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-22 17:47:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:07,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-22 17:47:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 17:47:07,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 187 [2024-11-22 17:47:07,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 201 transitions, 596 flow. Second operand has 35 states, 35 states have (on average 170.05714285714285) internal successors, (5952), 35 states have internal predecessors, (5952), 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-22 17:47:07,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:07,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 187 [2024-11-22 17:47:07,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:08,632 INFO L124 PetriNetUnfolderBase]: 264/1010 cut-off events. [2024-11-22 17:47:08,632 INFO L125 PetriNetUnfolderBase]: For 1079/1082 co-relation queries the response was YES. [2024-11-22 17:47:08,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2469 conditions, 1010 events. 264/1010 cut-off events. For 1079/1082 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3237 event pairs, 7 based on Foata normal form. 32/1029 useless extension candidates. Maximal degree in co-relation 2314. Up to 127 conditions per place. [2024-11-22 17:47:08,639 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 155 selfloop transitions, 47 changer transitions 0/370 dead transitions. [2024-11-22 17:47:08,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 370 transitions, 1552 flow [2024-11-22 17:47:08,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-22 17:47:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-22 17:47:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 7938 transitions. [2024-11-22 17:47:08,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228086491513602 [2024-11-22 17:47:08,655 INFO L175 Difference]: Start difference. First operand has 220 places, 201 transitions, 596 flow. Second operand 46 states and 7938 transitions. [2024-11-22 17:47:08,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 370 transitions, 1552 flow [2024-11-22 17:47:08,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 370 transitions, 1512 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-22 17:47:08,665 INFO L231 Difference]: Finished difference. Result has 260 places, 226 transitions, 847 flow [2024-11-22 17:47:08,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=847, PETRI_PLACES=260, PETRI_TRANSITIONS=226} [2024-11-22 17:47:08,667 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 80 predicate places. [2024-11-22 17:47:08,667 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 226 transitions, 847 flow [2024-11-22 17:47:08,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 170.05714285714285) internal successors, (5952), 35 states have internal predecessors, (5952), 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-22 17:47:08,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:08,670 INFO L204 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:47:08,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 17:47:08,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:08,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:08,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1459711253, now seen corresponding path program 4 times [2024-11-22 17:47:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509695738] [2024-11-22 17:47:08,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 17:47:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:08,915 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 17:47:08,915 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509695738] [2024-11-22 17:47:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509695738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:47:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305813659] [2024-11-22 17:47:09,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 17:47:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:09,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:47:09,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 17:47:10,023 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 17:47:10,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:10,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 17:47:10,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:47:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:10,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:47:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305813659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:47:11,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:47:11,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2024-11-22 17:47:11,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907140150] [2024-11-22 17:47:11,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:47:11,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-22 17:47:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-22 17:47:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2024-11-22 17:47:11,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 187 [2024-11-22 17:47:11,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 226 transitions, 847 flow. Second operand has 66 states, 66 states have (on average 170.0151515151515) internal successors, (11221), 66 states have internal predecessors, (11221), 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-22 17:47:11,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:11,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 187 [2024-11-22 17:47:11,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:14,141 INFO L124 PetriNetUnfolderBase]: 520/1778 cut-off events. [2024-11-22 17:47:14,142 INFO L125 PetriNetUnfolderBase]: For 2891/2894 co-relation queries the response was YES. [2024-11-22 17:47:14,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 1778 events. 520/1778 cut-off events. For 2891/2894 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5944 event pairs, 9 based on Foata normal form. 64/1828 useless extension candidates. Maximal degree in co-relation 4906. Up to 255 conditions per place. [2024-11-22 17:47:14,154 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 314 selfloop transitions, 93 changer transitions 0/575 dead transitions. [2024-11-22 17:47:14,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 575 transitions, 2963 flow [2024-11-22 17:47:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-22 17:47:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2024-11-22 17:47:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 16047 transitions. [2024-11-22 17:47:14,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227186475763326 [2024-11-22 17:47:14,175 INFO L175 Difference]: Start difference. First operand has 260 places, 226 transitions, 847 flow. Second operand 93 states and 16047 transitions. [2024-11-22 17:47:14,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 575 transitions, 2963 flow [2024-11-22 17:47:14,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 575 transitions, 2849 flow, removed 33 selfloop flow, removed 24 redundant places. [2024-11-22 17:47:14,191 INFO L231 Difference]: Finished difference. Result has 345 places, 275 transitions, 1438 flow [2024-11-22 17:47:14,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1438, PETRI_PLACES=345, PETRI_TRANSITIONS=275} [2024-11-22 17:47:14,193 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 165 predicate places. [2024-11-22 17:47:14,193 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 275 transitions, 1438 flow [2024-11-22 17:47:14,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 170.0151515151515) internal successors, (11221), 66 states have internal predecessors, (11221), 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-22 17:47:14,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:14,198 INFO L204 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:47:14,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 17:47:14,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 17:47:14,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1948136727, now seen corresponding path program 5 times [2024-11-22 17:47:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521091812] [2024-11-22 17:47:14,404 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 17:47:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:14,527 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-22 17:47:14,527 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:17,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:47:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521091812] [2024-11-22 17:47:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521091812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 17:47:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823839832] [2024-11-22 17:47:17,048 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 17:47:17,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:47:17,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 17:47:17,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 17:47:17,241 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-22 17:47:17,242 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 17:47:17,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-22 17:47:17,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 17:47:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:17,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 17:47:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:47:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823839832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 17:47:19,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 17:47:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 87 [2024-11-22 17:47:19,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501747225] [2024-11-22 17:47:19,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 17:47:19,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-11-22 17:47:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:47:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-11-22 17:47:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2024-11-22 17:47:19,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 187 [2024-11-22 17:47:19,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 275 transitions, 1438 flow. Second operand has 87 states, 87 states have (on average 170.0344827586207) internal successors, (14793), 87 states have internal predecessors, (14793), 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-22 17:47:19,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:47:19,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 187 [2024-11-22 17:47:19,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:47:23,845 INFO L124 PetriNetUnfolderBase]: 712/2354 cut-off events. [2024-11-22 17:47:23,845 INFO L125 PetriNetUnfolderBase]: For 9959/9962 co-relation queries the response was YES. [2024-11-22 17:47:23,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 2354 events. 712/2354 cut-off events. For 9959/9962 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 7991 event pairs, 9 based on Foata normal form. 48/2388 useless extension candidates. Maximal degree in co-relation 7322. Up to 351 conditions per place. [2024-11-22 17:47:23,863 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 434 selfloop transitions, 129 changer transitions 0/731 dead transitions. [2024-11-22 17:47:23,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 731 transitions, 4267 flow [2024-11-22 17:47:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-22 17:47:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2024-11-22 17:47:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 22247 transitions. [2024-11-22 17:47:23,881 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9222318948721138 [2024-11-22 17:47:23,881 INFO L175 Difference]: Start difference. First operand has 345 places, 275 transitions, 1438 flow. Second operand 129 states and 22247 transitions. [2024-11-22 17:47:23,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 731 transitions, 4267 flow [2024-11-22 17:47:23,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 731 transitions, 3991 flow, removed 17 selfloop flow, removed 44 redundant places. [2024-11-22 17:47:23,914 INFO L231 Difference]: Finished difference. Result has 442 places, 312 transitions, 1960 flow [2024-11-22 17:47:23,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=1960, PETRI_PLACES=442, PETRI_TRANSITIONS=312} [2024-11-22 17:47:23,915 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 262 predicate places. [2024-11-22 17:47:23,916 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 312 transitions, 1960 flow [2024-11-22 17:47:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 170.0344827586207) internal successors, (14793), 87 states have internal predecessors, (14793), 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-22 17:47:23,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:47:23,924 INFO L204 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:47:23,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 17:47:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 17:47:24,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-22 17:47:24,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:47:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash 947330059, now seen corresponding path program 6 times [2024-11-22 17:47:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:47:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548272399] [2024-11-22 17:47:24,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 17:47:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:47:24,289 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2024-11-22 17:47:24,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 17:47:24,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 17:47:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 17:47:24,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 17:47:24,500 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 17:47:24,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-11-22 17:47:24,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-22 17:47:24,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-22 17:47:24,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-22 17:47:24,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-22 17:47:24,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-22 17:47:24,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-22 17:47:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 17:47:24,504 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-22 17:47:24,698 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 17:47:24,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 17:47:24,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:47:24 BasicIcfg [2024-11-22 17:47:24,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 17:47:24,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 17:47:24,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 17:47:24,707 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 17:47:24,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:47:01" (3/4) ... [2024-11-22 17:47:24,708 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 17:47:24,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 17:47:24,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 17:47:24,835 INFO L158 Benchmark]: Toolchain (without parser) took 24553.43ms. Allocated memory was 165.7MB in the beginning and 444.6MB in the end (delta: 278.9MB). Free memory was 130.3MB in the beginning and 234.0MB in the end (delta: -103.7MB). Peak memory consumption was 176.5MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,836 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 17:47:24,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.93ms. Allocated memory is still 165.7MB. Free memory was 130.3MB in the beginning and 107.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.13ms. Allocated memory is still 165.7MB. Free memory was 107.5MB in the beginning and 104.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,839 INFO L158 Benchmark]: Boogie Preprocessor took 40.30ms. Allocated memory is still 165.7MB. Free memory was 104.4MB in the beginning and 103.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,839 INFO L158 Benchmark]: RCFGBuilder took 547.36ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 121.8MB in the end (delta: -18.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,839 INFO L158 Benchmark]: TraceAbstraction took 23269.94ms. Allocated memory was 165.7MB in the beginning and 444.6MB in the end (delta: 278.9MB). Free memory was 120.8MB in the beginning and 282.2MB in the end (delta: -161.5MB). Peak memory consumption was 293.6MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,840 INFO L158 Benchmark]: Witness Printer took 128.07ms. Allocated memory is still 444.6MB. Free memory was 282.2MB in the beginning and 234.0MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-22 17:47:24,841 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.19ms. Allocated memory is still 102.8MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.93ms. Allocated memory is still 165.7MB. Free memory was 130.3MB in the beginning and 107.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.13ms. Allocated memory is still 165.7MB. Free memory was 107.5MB in the beginning and 104.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.30ms. Allocated memory is still 165.7MB. Free memory was 104.4MB in the beginning and 103.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 547.36ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 121.8MB in the end (delta: -18.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 23269.94ms. Allocated memory was 165.7MB in the beginning and 444.6MB in the end (delta: 278.9MB). Free memory was 120.8MB in the beginning and 282.2MB in the end (delta: -161.5MB). Peak memory consumption was 293.6MB. Max. memory is 16.1GB. * Witness Printer took 128.07ms. Allocated memory is still 444.6MB. Free memory was 282.2MB in the beginning and 234.0MB in the end (delta: 48.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [lock={3:0}] [L699] 0 int x; VAL [lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [lock={3:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 int i = 0; VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 i++ VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=1, lock={3:0}, t=-1, x=1, x_set=0] [L713] 0 i++ VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L714] 0 x = i VAL [i=2, lock={3:0}, t=-1, x=2, x_set=0] [L713] 0 i++ VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L714] 0 x = i VAL [i=3, lock={3:0}, t=-1, x=3, x_set=0] [L713] 0 i++ VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L714] 0 x = i VAL [i=4, lock={3:0}, t=-1, x=4, x_set=0] [L713] 0 i++ VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L714] 0 x = i VAL [i=5, lock={3:0}, t=-1, x=5, x_set=0] [L713] 0 i++ VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L714] 0 x = i VAL [i=6, lock={3:0}, t=-1, x=6, x_set=0] [L713] 0 i++ VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L714] 0 x = i VAL [i=7, lock={3:0}, t=-1, x=7, x_set=0] [L713] 0 i++ VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L714] 0 x = i VAL [i=8, lock={3:0}, t=-1, x=8, x_set=0] [L713] 0 i++ VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L714] 0 x = i VAL [i=9, lock={3:0}, t=-1, x=9, x_set=0] [L713] 0 i++ VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L714] 0 x = i VAL [i=10, lock={3:0}, t=-1, x=10, x_set=0] [L713] 0 i++ VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L714] 0 x = i VAL [i=11, lock={3:0}, t=-1, x=11, x_set=0] [L713] 0 i++ VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L714] 0 x = i VAL [i=12, lock={3:0}, t=-1, x=12, x_set=0] [L713] 0 i++ VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L714] 0 x = i VAL [i=13, lock={3:0}, t=-1, x=13, x_set=0] [L713] 0 i++ VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L714] 0 x = i VAL [i=14, lock={3:0}, t=-1, x=14, x_set=0] [L713] 0 i++ VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L714] 0 x = i VAL [i=15, lock={3:0}, t=-1, x=15, x_set=0] [L713] 0 i++ VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L714] 0 x = i VAL [i=16, lock={3:0}, t=-1, x=16, x_set=0] [L713] 0 i++ VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L714] 0 x = i VAL [i=17, lock={3:0}, t=-1, x=17, x_set=0] [L713] 0 i++ VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L714] 0 x = i VAL [i=18, lock={3:0}, t=-1, x=18, x_set=0] [L713] 0 i++ VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L714] 0 x = i VAL [i=19, lock={3:0}, t=-1, x=19, x_set=0] [L713] 0 i++ VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L714] 0 x = i VAL [i=20, lock={3:0}, t=-1, x=20, x_set=0] [L713] 0 i++ VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L714] 0 x = i VAL [i=21, lock={3:0}, t=-1, x=21, x_set=0] [L713] 0 i++ VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L714] 0 x = i VAL [i=22, lock={3:0}, t=-1, x=22, x_set=0] [L713] 0 i++ VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L714] 0 x = i VAL [i=23, lock={3:0}, t=-1, x=23, x_set=0] [L713] 0 i++ VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L714] 0 x = i VAL [i=24, lock={3:0}, t=-1, x=24, x_set=0] [L713] 0 i++ VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L714] 0 x = i VAL [i=25, lock={3:0}, t=-1, x=25, x_set=0] [L713] 0 i++ VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L714] 0 x = i VAL [i=26, lock={3:0}, t=-1, x=26, x_set=0] [L713] 0 i++ VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L714] 0 x = i VAL [i=27, lock={3:0}, t=-1, x=27, x_set=0] [L713] 0 i++ VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L714] 0 x = i VAL [i=28, lock={3:0}, t=-1, x=28, x_set=0] [L713] 0 i++ VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L714] 0 x = i VAL [i=29, lock={3:0}, t=-1, x=29, x_set=0] [L713] 0 i++ VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L714] 0 x = i VAL [i=30, lock={3:0}, t=-1, x=30, x_set=0] [L713] 0 i++ VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L714] 0 x = i VAL [i=31, lock={3:0}, t=-1, x=31, x_set=0] [L713] 0 i++ VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L714] 0 x = i VAL [i=32, lock={3:0}, t=-1, x=32, x_set=0] [L713] 0 i++ VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L714] 0 x = i VAL [i=33, lock={3:0}, t=-1, x=33, x_set=0] [L713] 0 i++ VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L714] 0 x = i VAL [i=34, lock={3:0}, t=-1, x=34, x_set=0] [L713] 0 i++ VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L714] 0 x = i VAL [i=35, lock={3:0}, t=-1, x=35, x_set=0] [L713] 0 i++ VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L714] 0 x = i VAL [i=36, lock={3:0}, t=-1, x=36, x_set=0] [L713] 0 i++ VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L714] 0 x = i VAL [i=37, lock={3:0}, t=-1, x=37, x_set=0] [L713] 0 i++ VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L714] 0 x = i VAL [i=38, lock={3:0}, t=-1, x=38, x_set=0] [L713] 0 i++ VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L714] 0 x = i VAL [i=39, lock={3:0}, t=-1, x=39, x_set=0] [L713] 0 i++ VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L714] 0 x = i VAL [i=40, lock={3:0}, t=-1, x=40, x_set=0] [L713] 0 i++ VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L714] 0 x = i VAL [i=41, lock={3:0}, t=-1, x=41, x_set=0] [L713] 0 i++ VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L714] 0 x = i VAL [i=42, lock={3:0}, t=-1, x=42, x_set=0] [L713] 0 i++ VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L715] 0 x_set = 1 VAL [lock={3:0}, t=-1, x=42, x_set=1] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: 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. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 205 locations, 7 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: 23.0s, OverallIterations: 12, TraceHistogramMax: 43, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4089 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4029 mSDsluCounter, 383 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2042 IncrementalHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 29 mSDtfsCounter, 2042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2879 GetRequests, 2433 SyntacticMatches, 43 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12721 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1960occurred in iteration=11, InterpolantAutomatonStates: 316, 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.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 3926 NumberOfCodeBlocks, 3926 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 4612 ConstructedInterpolants, 0 QuantifiedInterpolants, 7528 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2623 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 1/14429 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-22 17:47:24,867 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