./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:10:05,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:10:05,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:10:05,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:10:05,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:10:05,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:10:05,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:10:05,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:10:05,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:10:05,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:10:05,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:10:05,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:10:05,787 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:10:05,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:10:05,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:10:05,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:10:05,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:10:05,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:10:05,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:10:05,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:10:05,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:10:05,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:10:05,791 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:10:05,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:10:05,791 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:10:05,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:10:05,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:10:05,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:10:05,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:10:05,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:10:05,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:10:05,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:05,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:10:05,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:10:05,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:10:05,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:10:05,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:10:05,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:10:05,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:10:05,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:10:05,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:10:05,797 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-clean/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-clean/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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2024-10-11 17:10:06,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:10:06,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:10:06,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:10:06,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:10:06,120 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:10:06,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-10-11 17:10:07,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:10:07,828 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:10:07,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2024-10-11 17:10:07,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e0f1d473/9dae6517fd5e4ba1951a7b1bb021a23d/FLAG74da5f76c [2024-10-11 17:10:08,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e0f1d473/9dae6517fd5e4ba1951a7b1bb021a23d [2024-10-11 17:10:08,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:10:08,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:10:08,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:08,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:10:08,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:10:08,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72bfe4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08, skipping insertion in model container [2024-10-11 17:10:08,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:10:08,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:08,598 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:10:08,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:10:08,714 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:10:08,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08 WrapperNode [2024-10-11 17:10:08,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:10:08,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:08,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:10:08,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:10:08,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,764 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2024-10-11 17:10:08,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:10:08,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:10:08,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:10:08,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:10:08,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,809 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:10:08,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:10:08,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:10:08,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:10:08,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (1/1) ... [2024-10-11 17:10:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:10:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:08,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:10:08,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:10:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:10:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:10:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 17:10:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:10:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:10:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 17:10:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 17:10:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:10:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:10:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 17:10:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:10:08,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:10:08,906 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:10:09,030 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:10:09,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:10:09,425 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:10:09,425 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:10:09,473 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:10:09,474 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 17:10:09,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:09 BoogieIcfgContainer [2024-10-11 17:10:09,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:10:09,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:10:09,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:10:09,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:10:09,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:10:08" (1/3) ... [2024-10-11 17:10:09,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b8614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:09, skipping insertion in model container [2024-10-11 17:10:09,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:10:08" (2/3) ... [2024-10-11 17:10:09,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231b8614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:10:09, skipping insertion in model container [2024-10-11 17:10:09,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:10:09" (3/3) ... [2024-10-11 17:10:09,482 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2024-10-11 17:10:09,495 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:10:09,495 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 17:10:09,495 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:10:09,562 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:10:09,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 174 transitions, 355 flow [2024-10-11 17:10:09,693 INFO L124 PetriNetUnfolderBase]: 19/238 cut-off events. [2024-10-11 17:10:09,693 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:10:09,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 238 events. 19/238 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 722 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 131. Up to 4 conditions per place. [2024-10-11 17:10:09,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 174 transitions, 355 flow [2024-10-11 17:10:09,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 174 transitions, 355 flow [2024-10-11 17:10:09,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:09,731 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;@37a4042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:09,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 17:10:09,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:09,749 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-10-11 17:10:09,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:09,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:09,750 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] [2024-10-11 17:10:09,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:09,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 444906109, now seen corresponding path program 1 times [2024-10-11 17:10:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131796522] [2024-10-11 17:10:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131796522] [2024-10-11 17:10:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131796522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041137639] [2024-10-11 17:10:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:10,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:10,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:10,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 174 [2024-10-11 17:10:10,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 174 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-10-11 17:10:10,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:10,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 174 [2024-10-11 17:10:10,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:11,661 INFO L124 PetriNetUnfolderBase]: 579/2162 cut-off events. [2024-10-11 17:10:11,661 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:10:11,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 2162 events. 579/2162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 14994 event pairs, 343 based on Foata normal form. 221/2220 useless extension candidates. Maximal degree in co-relation 3268. Up to 1080 conditions per place. [2024-10-11 17:10:11,680 INFO L140 encePairwiseOnDemand]: 139/174 looper letters, 73 selfloop transitions, 70 changer transitions 0/253 dead transitions. [2024-10-11 17:10:11,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 253 transitions, 799 flow [2024-10-11 17:10:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 846 transitions. [2024-10-11 17:10:11,699 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8103448275862069 [2024-10-11 17:10:11,703 INFO L175 Difference]: Start difference. First operand has 164 places, 174 transitions, 355 flow. Second operand 6 states and 846 transitions. [2024-10-11 17:10:11,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 253 transitions, 799 flow [2024-10-11 17:10:11,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 253 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:11,715 INFO L231 Difference]: Finished difference. Result has 172 places, 229 transitions, 789 flow [2024-10-11 17:10:11,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=789, PETRI_PLACES=172, PETRI_TRANSITIONS=229} [2024-10-11 17:10:11,723 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, 8 predicate places. [2024-10-11 17:10:11,724 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 229 transitions, 789 flow [2024-10-11 17:10:11,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-10-11 17:10:11,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:11,724 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] [2024-10-11 17:10:11,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:10:11,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:11,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1415329811, now seen corresponding path program 1 times [2024-10-11 17:10:11,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:11,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773978590] [2024-10-11 17:10:11,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:11,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773978590] [2024-10-11 17:10:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773978590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:11,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262476118] [2024-10-11 17:10:11,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:11,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:11,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2024-10-11 17:10:11,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 229 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-10-11 17:10:11,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:11,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2024-10-11 17:10:11,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:11,969 INFO L124 PetriNetUnfolderBase]: 188/1066 cut-off events. [2024-10-11 17:10:11,969 INFO L125 PetriNetUnfolderBase]: For 119/133 co-relation queries the response was YES. [2024-10-11 17:10:11,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1066 events. 188/1066 cut-off events. For 119/133 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6127 event pairs, 28 based on Foata normal form. 1/995 useless extension candidates. Maximal degree in co-relation 1641. Up to 191 conditions per place. [2024-10-11 17:10:11,976 INFO L140 encePairwiseOnDemand]: 171/174 looper letters, 22 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2024-10-11 17:10:11,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 235 transitions, 851 flow [2024-10-11 17:10:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2024-10-11 17:10:11,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8697318007662835 [2024-10-11 17:10:11,979 INFO L175 Difference]: Start difference. First operand has 172 places, 229 transitions, 789 flow. Second operand 3 states and 454 transitions. [2024-10-11 17:10:11,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 235 transitions, 851 flow [2024-10-11 17:10:11,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 235 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:11,989 INFO L231 Difference]: Finished difference. Result has 175 places, 229 transitions, 800 flow [2024-10-11 17:10:11,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=175, PETRI_TRANSITIONS=229} [2024-10-11 17:10:11,992 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, 11 predicate places. [2024-10-11 17:10:11,992 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 229 transitions, 800 flow [2024-10-11 17:10:11,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-10-11 17:10:11,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:11,993 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] [2024-10-11 17:10:11,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:10:11,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:11,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash -114677429, now seen corresponding path program 1 times [2024-10-11 17:10:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276833012] [2024-10-11 17:10:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:12,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276833012] [2024-10-11 17:10:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276833012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:12,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055211982] [2024-10-11 17:10:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:12,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:12,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:12,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:12,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 174 [2024-10-11 17:10:12,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 229 transitions, 800 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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-10-11 17:10:12,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:12,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 174 [2024-10-11 17:10:12,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:12,866 INFO L124 PetriNetUnfolderBase]: 370/1401 cut-off events. [2024-10-11 17:10:12,866 INFO L125 PetriNetUnfolderBase]: For 463/482 co-relation queries the response was YES. [2024-10-11 17:10:12,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 1401 events. 370/1401 cut-off events. For 463/482 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8897 event pairs, 110 based on Foata normal form. 2/1367 useless extension candidates. Maximal degree in co-relation 2955. Up to 642 conditions per place. [2024-10-11 17:10:12,876 INFO L140 encePairwiseOnDemand]: 156/174 looper letters, 112 selfloop transitions, 53 changer transitions 0/288 dead transitions. [2024-10-11 17:10:12,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 288 transitions, 1372 flow [2024-10-11 17:10:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 815 transitions. [2024-10-11 17:10:12,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7806513409961686 [2024-10-11 17:10:12,880 INFO L175 Difference]: Start difference. First operand has 175 places, 229 transitions, 800 flow. Second operand 6 states and 815 transitions. [2024-10-11 17:10:12,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 288 transitions, 1372 flow [2024-10-11 17:10:12,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 288 transitions, 1366 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:10:12,893 INFO L231 Difference]: Finished difference. Result has 183 places, 272 transitions, 1282 flow [2024-10-11 17:10:12,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1282, PETRI_PLACES=183, PETRI_TRANSITIONS=272} [2024-10-11 17:10:12,895 INFO L277 CegarLoopForPetriNet]: 164 programPoint places, 19 predicate places. [2024-10-11 17:10:12,895 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 272 transitions, 1282 flow [2024-10-11 17:10:12,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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-10-11 17:10:12,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:12,896 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:12,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:10:12,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-11 17:10:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1084909899, now seen corresponding path program 1 times [2024-10-11 17:10:12,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:12,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784419294] [2024-10-11 17:10:12,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:12,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:10:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:10:12,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:10:12,977 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:10:12,978 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-11 17:10:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-11 17:10:12,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-11 17:10:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-11 17:10:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-11 17:10:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-11 17:10:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-11 17:10:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-11 17:10:12,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-11 17:10:12,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-11 17:10:12,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-11 17:10:12,986 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-11 17:10:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:10:12,986 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 17:10:12,989 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 17:10:12,990 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 17:10:13,035 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:10:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 240 transitions, 496 flow [2024-10-11 17:10:13,088 INFO L124 PetriNetUnfolderBase]: 34/396 cut-off events. [2024-10-11 17:10:13,088 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:10:13,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 396 events. 34/396 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1490 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 240. Up to 8 conditions per place. [2024-10-11 17:10:13,094 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 240 transitions, 496 flow [2024-10-11 17:10:13,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 240 transitions, 496 flow [2024-10-11 17:10:13,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:10:13,104 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;@37a4042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:10:13,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-11 17:10:13,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:10:13,110 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-10-11 17:10:13,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:10:13,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:13,111 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] [2024-10-11 17:10:13,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -388380307, now seen corresponding path program 1 times [2024-10-11 17:10:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318882684] [2024-10-11 17:10:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:13,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318882684] [2024-10-11 17:10:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318882684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:13,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655203762] [2024-10-11 17:10:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:13,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:13,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:13,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 240 [2024-10-11 17:10:13,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 240 transitions, 496 flow. Second operand has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 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-10-11 17:10:13,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:13,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 240 [2024-10-11 17:10:13,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:22,005 INFO L124 PetriNetUnfolderBase]: 29150/68118 cut-off events. [2024-10-11 17:10:22,006 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2024-10-11 17:10:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113652 conditions, 68118 events. 29150/68118 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 755793 event pairs, 19147 based on Foata normal form. 8128/72246 useless extension candidates. Maximal degree in co-relation 99469. Up to 40547 conditions per place. [2024-10-11 17:10:22,422 INFO L140 encePairwiseOnDemand]: 183/240 looper letters, 122 selfloop transitions, 134 changer transitions 0/402 dead transitions. [2024-10-11 17:10:22,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 402 transitions, 1337 flow [2024-10-11 17:10:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2024-10-11 17:10:22,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8368055555555556 [2024-10-11 17:10:22,429 INFO L175 Difference]: Start difference. First operand has 225 places, 240 transitions, 496 flow. Second operand 6 states and 1205 transitions. [2024-10-11 17:10:22,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 402 transitions, 1337 flow [2024-10-11 17:10:22,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 402 transitions, 1337 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:22,448 INFO L231 Difference]: Finished difference. Result has 233 places, 353 transitions, 1334 flow [2024-10-11 17:10:22,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1334, PETRI_PLACES=233, PETRI_TRANSITIONS=353} [2024-10-11 17:10:22,451 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 8 predicate places. [2024-10-11 17:10:22,451 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 353 transitions, 1334 flow [2024-10-11 17:10:22,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 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-10-11 17:10:22,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:22,453 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:10:22,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:10:22,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -508991229, now seen corresponding path program 1 times [2024-10-11 17:10:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871201598] [2024-10-11 17:10:22,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871201598] [2024-10-11 17:10:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871201598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:22,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:22,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:10:22,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241465007] [2024-10-11 17:10:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:22,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:10:22,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:10:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:10:22,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 240 [2024-10-11 17:10:22,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 353 transitions, 1334 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-10-11 17:10:22,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:22,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 240 [2024-10-11 17:10:22,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:26,067 INFO L124 PetriNetUnfolderBase]: 9617/30385 cut-off events. [2024-10-11 17:10:26,067 INFO L125 PetriNetUnfolderBase]: For 5255/5598 co-relation queries the response was YES. [2024-10-11 17:10:26,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54689 conditions, 30385 events. 9617/30385 cut-off events. For 5255/5598 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 342679 event pairs, 3405 based on Foata normal form. 1/27884 useless extension candidates. Maximal degree in co-relation 28177. Up to 8560 conditions per place. [2024-10-11 17:10:26,264 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 32 selfloop transitions, 3 changer transitions 0/361 dead transitions. [2024-10-11 17:10:26,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 361 transitions, 1426 flow [2024-10-11 17:10:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:10:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:10:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2024-10-11 17:10:26,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8597222222222223 [2024-10-11 17:10:26,267 INFO L175 Difference]: Start difference. First operand has 233 places, 353 transitions, 1334 flow. Second operand 3 states and 619 transitions. [2024-10-11 17:10:26,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 361 transitions, 1426 flow [2024-10-11 17:10:26,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 361 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:26,397 INFO L231 Difference]: Finished difference. Result has 236 places, 355 transitions, 1359 flow [2024-10-11 17:10:26,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=236, PETRI_TRANSITIONS=355} [2024-10-11 17:10:26,400 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 11 predicate places. [2024-10-11 17:10:26,402 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 355 transitions, 1359 flow [2024-10-11 17:10:26,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-10-11 17:10:26,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:26,403 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] [2024-10-11 17:10:26,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:10:26,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:26,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 311430651, now seen corresponding path program 1 times [2024-10-11 17:10:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888958059] [2024-10-11 17:10:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888958059] [2024-10-11 17:10:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888958059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627032888] [2024-10-11 17:10:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:26,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:26,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:27,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 240 [2024-10-11 17:10:27,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 355 transitions, 1359 flow. Second operand has 6 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 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-10-11 17:10:27,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:27,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 240 [2024-10-11 17:10:27,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:33,985 INFO L124 PetriNetUnfolderBase]: 22797/56655 cut-off events. [2024-10-11 17:10:33,985 INFO L125 PetriNetUnfolderBase]: For 20609/22086 co-relation queries the response was YES. [2024-10-11 17:10:34,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124181 conditions, 56655 events. 22797/56655 cut-off events. For 20609/22086 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 638811 event pairs, 7815 based on Foata normal form. 50/53399 useless extension candidates. Maximal degree in co-relation 124006. Up to 26586 conditions per place. [2024-10-11 17:10:34,464 INFO L140 encePairwiseOnDemand]: 214/240 looper letters, 192 selfloop transitions, 141 changer transitions 0/534 dead transitions. [2024-10-11 17:10:34,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 534 transitions, 2827 flow [2024-10-11 17:10:34,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1159 transitions. [2024-10-11 17:10:34,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8048611111111111 [2024-10-11 17:10:34,471 INFO L175 Difference]: Start difference. First operand has 236 places, 355 transitions, 1359 flow. Second operand 6 states and 1159 transitions. [2024-10-11 17:10:34,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 534 transitions, 2827 flow [2024-10-11 17:10:34,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 534 transitions, 2824 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:10:34,726 INFO L231 Difference]: Finished difference. Result has 245 places, 486 transitions, 2740 flow [2024-10-11 17:10:34,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2740, PETRI_PLACES=245, PETRI_TRANSITIONS=486} [2024-10-11 17:10:34,727 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 20 predicate places. [2024-10-11 17:10:34,727 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 486 transitions, 2740 flow [2024-10-11 17:10:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 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-10-11 17:10:34,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:34,728 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] [2024-10-11 17:10:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:10:34,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:34,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash -197247402, now seen corresponding path program 1 times [2024-10-11 17:10:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732641332] [2024-10-11 17:10:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:34,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732641332] [2024-10-11 17:10:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732641332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:10:34,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236100336] [2024-10-11 17:10:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:34,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:34,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:34,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:10:34,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:10:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:34,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:10:34,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:10:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:35,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:10:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:35,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236100336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:10:35,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:10:35,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-11 17:10:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012220885] [2024-10-11 17:10:35,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:10:35,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:10:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:35,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:10:35,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:10:35,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 240 [2024-10-11 17:10:35,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 486 transitions, 2740 flow. Second operand has 10 states, 10 states have (on average 194.3) internal successors, (1943), 10 states have internal predecessors, (1943), 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-10-11 17:10:35,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:35,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 240 [2024-10-11 17:10:35,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:39,650 INFO L124 PetriNetUnfolderBase]: 13115/35730 cut-off events. [2024-10-11 17:10:39,651 INFO L125 PetriNetUnfolderBase]: For 25479/27571 co-relation queries the response was YES. [2024-10-11 17:10:39,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87991 conditions, 35730 events. 13115/35730 cut-off events. For 25479/27571 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 380555 event pairs, 2100 based on Foata normal form. 223/34137 useless extension candidates. Maximal degree in co-relation 41034. Up to 14137 conditions per place. [2024-10-11 17:10:39,933 INFO L140 encePairwiseOnDemand]: 235/240 looper letters, 72 selfloop transitions, 9 changer transitions 0/494 dead transitions. [2024-10-11 17:10:39,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 494 transitions, 2910 flow [2024-10-11 17:10:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:10:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:10:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1809 transitions. [2024-10-11 17:10:39,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8375 [2024-10-11 17:10:39,939 INFO L175 Difference]: Start difference. First operand has 245 places, 486 transitions, 2740 flow. Second operand 9 states and 1809 transitions. [2024-10-11 17:10:39,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 494 transitions, 2910 flow [2024-10-11 17:10:40,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 494 transitions, 2892 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-10-11 17:10:40,314 INFO L231 Difference]: Finished difference. Result has 205 places, 438 transitions, 2636 flow [2024-10-11 17:10:40,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2614, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2636, PETRI_PLACES=205, PETRI_TRANSITIONS=438} [2024-10-11 17:10:40,316 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -20 predicate places. [2024-10-11 17:10:40,316 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 438 transitions, 2636 flow [2024-10-11 17:10:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 194.3) internal successors, (1943), 10 states have internal predecessors, (1943), 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-10-11 17:10:40,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:40,317 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] [2024-10-11 17:10:40,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:10:40,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:40,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:40,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash -859330556, now seen corresponding path program 1 times [2024-10-11 17:10:40,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:40,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604734881] [2024-10-11 17:10:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:40,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:10:41,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604734881] [2024-10-11 17:10:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604734881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:10:41,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:10:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:10:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81792207] [2024-10-11 17:10:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:10:41,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:10:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:10:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:10:41,271 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 240 [2024-10-11 17:10:41,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 438 transitions, 2636 flow. Second operand has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 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-10-11 17:10:41,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:41,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 240 [2024-10-11 17:10:41,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:10:46,694 INFO L124 PetriNetUnfolderBase]: 19386/43479 cut-off events. [2024-10-11 17:10:46,694 INFO L125 PetriNetUnfolderBase]: For 43755/46151 co-relation queries the response was YES. [2024-10-11 17:10:46,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129837 conditions, 43479 events. 19386/43479 cut-off events. For 43755/46151 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 431883 event pairs, 5110 based on Foata normal form. 41/41815 useless extension candidates. Maximal degree in co-relation 110768. Up to 28123 conditions per place. [2024-10-11 17:10:47,272 INFO L140 encePairwiseOnDemand]: 213/240 looper letters, 338 selfloop transitions, 213 changer transitions 0/669 dead transitions. [2024-10-11 17:10:47,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 669 transitions, 5080 flow [2024-10-11 17:10:47,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:10:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:10:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1066 transitions. [2024-10-11 17:10:47,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7402777777777778 [2024-10-11 17:10:47,275 INFO L175 Difference]: Start difference. First operand has 205 places, 438 transitions, 2636 flow. Second operand 6 states and 1066 transitions. [2024-10-11 17:10:47,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 669 transitions, 5080 flow [2024-10-11 17:10:47,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 669 transitions, 5057 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-10-11 17:10:47,536 INFO L231 Difference]: Finished difference. Result has 210 places, 641 transitions, 4923 flow [2024-10-11 17:10:47,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4923, PETRI_PLACES=210, PETRI_TRANSITIONS=641} [2024-10-11 17:10:47,538 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, -15 predicate places. [2024-10-11 17:10:47,538 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 641 transitions, 4923 flow [2024-10-11 17:10:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 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-10-11 17:10:47,539 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:10:47,539 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 17:10:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:10:47,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-11 17:10:47,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:10:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1786958820, now seen corresponding path program 1 times [2024-10-11 17:10:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:10:47,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151942793] [2024-10-11 17:10:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:10:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:10:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:10:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151942793] [2024-10-11 17:10:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151942793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:10:48,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229243793] [2024-10-11 17:10:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:10:48,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:10:48,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:10:48,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:10:48,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:10:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:10:48,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 17:10:48,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:10:48,348 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:10:48,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:10:48,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:10:48,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:10:48,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:10:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:10:48,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:10:48,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:10:48,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-11 17:10:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:10:48,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:10:48,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store |c_#race| |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))))) is different from false [2024-10-11 17:10:48,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet16#1|)))) (and (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet16#1|)) (forall ((v_ArrVal_267 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet16#1| (select (select (store .cse0 |c_~#global~0.base| v_ArrVal_267) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))))))) is different from false [2024-10-11 17:10:49,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:10:49,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-11 17:10:49,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:10:49,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-10-11 17:10:49,143 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:10:49,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-11 17:10:49,152 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:10:49,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:10:49,162 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:10:49,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:10:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-10-11 17:10:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229243793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:10:53,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:10:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-10-11 17:10:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452133639] [2024-10-11 17:10:53,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:10:53,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:10:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:10:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:10:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=248, Unknown=28, NotChecked=70, Total=420 [2024-10-11 17:10:53,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 240 [2024-10-11 17:10:53,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 641 transitions, 4923 flow. Second operand has 21 states, 21 states have (on average 109.0952380952381) internal successors, (2291), 21 states have internal predecessors, (2291), 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-10-11 17:10:53,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:10:53,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 240 [2024-10-11 17:10:53,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand