./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:56:04,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:56:05,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:56:05,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:56:05,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:56:05,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:56:05,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:56:05,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:56:05,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:56:05,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:56:05,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:56:05,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:56:05,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:56:05,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:56:05,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:56:05,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:56:05,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:56:05,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:56:05,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:56:05,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:56:05,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:56:05,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:56:05,115 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:56:05,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:56:05,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:56:05,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:56:05,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:56:05,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:56:05,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:56:05,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:56:05,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:56:05,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:56:05,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:56:05,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:56:05,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:56:05,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:56:05,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:56:05,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:56:05,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:56:05,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:56:05,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:56:05,122 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78ae3f0dde82ce244d0cacebded5945a3f759d1f5aeba1d4553a1f59ef165385 [2024-11-09 06:56:05,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:56:05,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:56:05,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:56:05,453 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:56:05,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:56:05,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2024-11-09 06:56:06,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:56:07,293 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:56:07,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_37-indirect_racing.i [2024-11-09 06:56:07,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ef22b2c/7fce37c9174d4c66a9ceb503d07c4a41/FLAG8cf72e8c7 [2024-11-09 06:56:07,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ef22b2c/7fce37c9174d4c66a9ceb503d07c4a41 [2024-11-09 06:56:07,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:56:07,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:56:07,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:56:07,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:56:07,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:56:07,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19b89c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07, skipping insertion in model container [2024-11-09 06:56:07,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:56:07,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:56:07,787 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:56:07,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:56:07,908 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:56:07,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07 WrapperNode [2024-11-09 06:56:07,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:56:07,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:56:07,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:56:07,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:56:07,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,973 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2024-11-09 06:56:07,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:56:07,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:56:07,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:56:07,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:56:07,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:07,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:08,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:08,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:08,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:08,027 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:08,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:56:08,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:56:08,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:56:08,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:56:08,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (1/1) ... [2024-11-09 06:56:08,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:56:08,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:08,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:56:08,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:56:08,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:56:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:56:08,134 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:56:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:56:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:56:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:56:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:56:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:56:08,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:56:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:56:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:56:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:56:08,137 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:56:08,257 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:56:08,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:56:08,612 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:56:08,613 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:56:08,674 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:56:08,674 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 06:56:08,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:08 BoogieIcfgContainer [2024-11-09 06:56:08,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:56:08,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:56:08,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:56:08,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:56:08,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:56:07" (1/3) ... [2024-11-09 06:56:08,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5222ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:08, skipping insertion in model container [2024-11-09 06:56:08,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:56:07" (2/3) ... [2024-11-09 06:56:08,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5222ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:56:08, skipping insertion in model container [2024-11-09 06:56:08,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:56:08" (3/3) ... [2024-11-09 06:56:08,683 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_37-indirect_racing.i [2024-11-09 06:56:08,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:56:08,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 06:56:08,700 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:56:08,762 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:56:08,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 185 transitions, 377 flow [2024-11-09 06:56:08,886 INFO L124 PetriNetUnfolderBase]: 19/248 cut-off events. [2024-11-09 06:56:08,887 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:56:08,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 248 events. 19/248 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 750 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2024-11-09 06:56:08,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 185 transitions, 377 flow [2024-11-09 06:56:08,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 185 transitions, 377 flow [2024-11-09 06:56:08,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:56:08,922 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;@3d0ca2fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:56:08,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-09 06:56:08,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:56:08,933 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-11-09 06:56:08,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:56:08,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:08,935 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] [2024-11-09 06:56:08,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:08,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:08,942 INFO L85 PathProgramCache]: Analyzing trace with hash -519905131, now seen corresponding path program 1 times [2024-11-09 06:56:08,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:08,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716347961] [2024-11-09 06:56:08,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716347961] [2024-11-09 06:56:09,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716347961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:09,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:09,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:09,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196622971] [2024-11-09 06:56:09,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:09,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2024-11-09 06:56:09,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 185 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:09,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:09,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2024-11-09 06:56:09,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:09,520 INFO L124 PetriNetUnfolderBase]: 25/497 cut-off events. [2024-11-09 06:56:09,520 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:56:09,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 497 events. 25/497 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1943 event pairs, 24 based on Foata normal form. 54/500 useless extension candidates. Maximal degree in co-relation 451. Up to 69 conditions per place. [2024-11-09 06:56:09,528 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 16 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-09 06:56:09,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 383 flow [2024-11-09 06:56:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2024-11-09 06:56:09,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828828828828829 [2024-11-09 06:56:09,547 INFO L175 Difference]: Start difference. First operand has 175 places, 185 transitions, 377 flow. Second operand 3 states and 490 transitions. [2024-11-09 06:56:09,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 383 flow [2024-11-09 06:56:09,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 170 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:09,558 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 351 flow [2024-11-09 06:56:09,561 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2024-11-09 06:56:09,567 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, -1 predicate places. [2024-11-09 06:56:09,568 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 351 flow [2024-11-09 06:56:09,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:09,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:09,570 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] [2024-11-09 06:56:09,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:56:09,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:09,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1412609993, now seen corresponding path program 1 times [2024-11-09 06:56:09,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:09,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476367295] [2024-11-09 06:56:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:09,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:09,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476367295] [2024-11-09 06:56:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476367295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:09,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:09,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790931718] [2024-11-09 06:56:09,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:09,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:09,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2024-11-09 06:56:09,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:09,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:09,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2024-11-09 06:56:09,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:09,803 INFO L124 PetriNetUnfolderBase]: 25/494 cut-off events. [2024-11-09 06:56:09,803 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:56:09,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 494 events. 25/494 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1936 event pairs, 24 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 530. Up to 66 conditions per place. [2024-11-09 06:56:09,811 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 14 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2024-11-09 06:56:09,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 377 flow [2024-11-09 06:56:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2024-11-09 06:56:09,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8684684684684685 [2024-11-09 06:56:09,816 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 351 flow. Second operand 3 states and 482 transitions. [2024-11-09 06:56:09,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 168 transitions, 377 flow [2024-11-09 06:56:09,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 168 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:09,826 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 345 flow [2024-11-09 06:56:09,827 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2024-11-09 06:56:09,828 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2024-11-09 06:56:09,828 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 345 flow [2024-11-09 06:56:09,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:09,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:09,829 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] [2024-11-09 06:56:09,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:56:09,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:09,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash -138604748, now seen corresponding path program 1 times [2024-11-09 06:56:09,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:09,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204259318] [2024-11-09 06:56:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204259318] [2024-11-09 06:56:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204259318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093109174] [2024-11-09 06:56:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:09,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2024-11-09 06:56:09,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:09,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:09,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2024-11-09 06:56:09,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:10,083 INFO L124 PetriNetUnfolderBase]: 25/431 cut-off events. [2024-11-09 06:56:10,083 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:56:10,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 431 events. 25/431 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1623 event pairs, 24 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 470. Up to 68 conditions per place. [2024-11-09 06:56:10,086 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 16 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-11-09 06:56:10,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 167 transitions, 379 flow [2024-11-09 06:56:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2024-11-09 06:56:10,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8612612612612612 [2024-11-09 06:56:10,090 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 345 flow. Second operand 3 states and 478 transitions. [2024-11-09 06:56:10,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 167 transitions, 379 flow [2024-11-09 06:56:10,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 167 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:56:10,096 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 346 flow [2024-11-09 06:56:10,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=172, PETRI_TRANSITIONS=167} [2024-11-09 06:56:10,099 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, -3 predicate places. [2024-11-09 06:56:10,099 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 346 flow [2024-11-09 06:56:10,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:10,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:10,101 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] [2024-11-09 06:56:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:56:10,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:10,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash 798048297, now seen corresponding path program 1 times [2024-11-09 06:56:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546437673] [2024-11-09 06:56:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:10,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:10,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546437673] [2024-11-09 06:56:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546437673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617682094] [2024-11-09 06:56:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:10,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:10,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:10,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:10,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 185 [2024-11-09 06:56:10,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 167 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:10,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:10,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 185 [2024-11-09 06:56:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:11,340 INFO L124 PetriNetUnfolderBase]: 535/2115 cut-off events. [2024-11-09 06:56:11,340 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:56:11,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 2115 events. 535/2115 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 14624 event pairs, 303 based on Foata normal form. 0/1940 useless extension candidates. Maximal degree in co-relation 3247. Up to 988 conditions per place. [2024-11-09 06:56:11,355 INFO L140 encePairwiseOnDemand]: 162/185 looper letters, 71 selfloop transitions, 70 changer transitions 0/260 dead transitions. [2024-11-09 06:56:11,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 260 transitions, 814 flow [2024-11-09 06:56:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:56:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 886 transitions. [2024-11-09 06:56:11,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7981981981981981 [2024-11-09 06:56:11,358 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 346 flow. Second operand 6 states and 886 transitions. [2024-11-09 06:56:11,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 260 transitions, 814 flow [2024-11-09 06:56:11,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 260 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:11,367 INFO L231 Difference]: Finished difference. Result has 180 places, 236 transitions, 804 flow [2024-11-09 06:56:11,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=180, PETRI_TRANSITIONS=236} [2024-11-09 06:56:11,369 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, 5 predicate places. [2024-11-09 06:56:11,370 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 236 transitions, 804 flow [2024-11-09 06:56:11,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:11,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:11,371 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] [2024-11-09 06:56:11,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:56:11,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:11,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 329997752, now seen corresponding path program 1 times [2024-11-09 06:56:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:11,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123964403] [2024-11-09 06:56:11,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:11,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123964403] [2024-11-09 06:56:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123964403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:11,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:11,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966838813] [2024-11-09 06:56:11,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:11,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:11,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2024-11-09 06:56:11,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 236 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:11,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:11,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2024-11-09 06:56:11,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:11,605 INFO L124 PetriNetUnfolderBase]: 176/1067 cut-off events. [2024-11-09 06:56:11,605 INFO L125 PetriNetUnfolderBase]: For 119/136 co-relation queries the response was YES. [2024-11-09 06:56:11,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1729 conditions, 1067 events. 176/1067 cut-off events. For 119/136 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6029 event pairs, 20 based on Foata normal form. 1/991 useless extension candidates. Maximal degree in co-relation 1687. Up to 191 conditions per place. [2024-11-09 06:56:11,613 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 20 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2024-11-09 06:56:11,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 242 transitions, 862 flow [2024-11-09 06:56:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2024-11-09 06:56:11,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8846846846846846 [2024-11-09 06:56:11,615 INFO L175 Difference]: Start difference. First operand has 180 places, 236 transitions, 804 flow. Second operand 3 states and 491 transitions. [2024-11-09 06:56:11,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 242 transitions, 862 flow [2024-11-09 06:56:11,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 242 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:11,623 INFO L231 Difference]: Finished difference. Result has 183 places, 236 transitions, 815 flow [2024-11-09 06:56:11,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=815, PETRI_PLACES=183, PETRI_TRANSITIONS=236} [2024-11-09 06:56:11,625 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, 8 predicate places. [2024-11-09 06:56:11,625 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 236 transitions, 815 flow [2024-11-09 06:56:11,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:11,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:11,626 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] [2024-11-09 06:56:11,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:56:11,626 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:11,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash -571676016, now seen corresponding path program 1 times [2024-11-09 06:56:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:11,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582610158] [2024-11-09 06:56:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582610158] [2024-11-09 06:56:11,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582610158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:11,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159909039] [2024-11-09 06:56:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:11,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:11,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 185 [2024-11-09 06:56:11,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 236 transitions, 815 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:11,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:11,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 185 [2024-11-09 06:56:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:11,806 INFO L124 PetriNetUnfolderBase]: 145/864 cut-off events. [2024-11-09 06:56:11,806 INFO L125 PetriNetUnfolderBase]: For 109/128 co-relation queries the response was YES. [2024-11-09 06:56:11,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 864 events. 145/864 cut-off events. For 109/128 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4710 event pairs, 4 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 1463. Up to 221 conditions per place. [2024-11-09 06:56:11,812 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 16 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2024-11-09 06:56:11,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 236 transitions, 849 flow [2024-11-09 06:56:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2024-11-09 06:56:11,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.872072072072072 [2024-11-09 06:56:11,814 INFO L175 Difference]: Start difference. First operand has 183 places, 236 transitions, 815 flow. Second operand 3 states and 484 transitions. [2024-11-09 06:56:11,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 236 transitions, 849 flow [2024-11-09 06:56:11,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 236 transitions, 843 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:11,823 INFO L231 Difference]: Finished difference. Result has 181 places, 234 transitions, 807 flow [2024-11-09 06:56:11,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=807, PETRI_PLACES=181, PETRI_TRANSITIONS=234} [2024-11-09 06:56:11,824 INFO L277 CegarLoopForPetriNet]: 175 programPoint places, 6 predicate places. [2024-11-09 06:56:11,825 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 234 transitions, 807 flow [2024-11-09 06:56:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:11,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:11,826 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, 1, 1, 1, 1] [2024-11-09 06:56:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:56:11,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-09 06:56:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1394837605, now seen corresponding path program 1 times [2024-11-09 06:56:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409590636] [2024-11-09 06:56:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:56:11,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:56:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:56:11,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:56:11,909 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:56:11,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-09 06:56:11,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-09 06:56:11,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-09 06:56:11,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-09 06:56:11,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-09 06:56:11,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-09 06:56:11,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-09 06:56:11,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-09 06:56:11,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-09 06:56:11,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-09 06:56:11,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-09 06:56:11,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-09 06:56:11,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-09 06:56:11,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-09 06:56:11,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-09 06:56:11,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-09 06:56:11,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-09 06:56:11,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-09 06:56:11,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-09 06:56:11,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-09 06:56:11,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:56:11,918 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:11,920 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:56:11,920 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:56:11,960 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:56:11,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 528 flow [2024-11-09 06:56:12,009 INFO L124 PetriNetUnfolderBase]: 34/410 cut-off events. [2024-11-09 06:56:12,009 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:56:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 410 events. 34/410 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1564 event pairs, 0 based on Foata normal form. 0/344 useless extension candidates. Maximal degree in co-relation 250. Up to 8 conditions per place. [2024-11-09 06:56:12,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 528 flow [2024-11-09 06:56:12,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 256 transitions, 528 flow [2024-11-09 06:56:12,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:56:12,021 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;@3d0ca2fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:56:12,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 06:56:12,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:56:12,024 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-11-09 06:56:12,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:56:12,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:12,024 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] [2024-11-09 06:56:12,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:12,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1225064853, now seen corresponding path program 1 times [2024-11-09 06:56:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370086227] [2024-11-09 06:56:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370086227] [2024-11-09 06:56:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370086227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:12,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:12,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106069635] [2024-11-09 06:56:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:12,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:12,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 256 [2024-11-09 06:56:12,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 256 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:12,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:12,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 256 [2024-11-09 06:56:12,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:12,686 INFO L124 PetriNetUnfolderBase]: 430/3697 cut-off events. [2024-11-09 06:56:12,686 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-09 06:56:12,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4481 conditions, 3697 events. 430/3697 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 32095 event pairs, 420 based on Foata normal form. 578/3897 useless extension candidates. Maximal degree in co-relation 3717. Up to 739 conditions per place. [2024-11-09 06:56:12,715 INFO L140 encePairwiseOnDemand]: 235/256 looper letters, 24 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-11-09 06:56:12,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 235 transitions, 538 flow [2024-11-09 06:56:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-11-09 06:56:12,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.87890625 [2024-11-09 06:56:12,718 INFO L175 Difference]: Start difference. First operand has 241 places, 256 transitions, 528 flow. Second operand 3 states and 675 transitions. [2024-11-09 06:56:12,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 235 transitions, 538 flow [2024-11-09 06:56:12,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 235 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:12,723 INFO L231 Difference]: Finished difference. Result has 240 places, 235 transitions, 490 flow [2024-11-09 06:56:12,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=240, PETRI_TRANSITIONS=235} [2024-11-09 06:56:12,724 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -1 predicate places. [2024-11-09 06:56:12,724 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 235 transitions, 490 flow [2024-11-09 06:56:12,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:12,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:12,725 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] [2024-11-09 06:56:12,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:56:12,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:12,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 466307383, now seen corresponding path program 1 times [2024-11-09 06:56:12,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:12,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043751022] [2024-11-09 06:56:12,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:12,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:12,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043751022] [2024-11-09 06:56:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043751022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:12,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:12,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262554780] [2024-11-09 06:56:12,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:12,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:12,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:12,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 256 [2024-11-09 06:56:12,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 235 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:12,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:12,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 256 [2024-11-09 06:56:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:13,319 INFO L124 PetriNetUnfolderBase]: 418/3631 cut-off events. [2024-11-09 06:56:13,319 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-09 06:56:13,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4396 conditions, 3631 events. 418/3631 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 31166 event pairs, 414 based on Foata normal form. 0/3274 useless extension candidates. Maximal degree in co-relation 4355. Up to 717 conditions per place. [2024-11-09 06:56:13,349 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 22 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2024-11-09 06:56:13,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 532 flow [2024-11-09 06:56:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2024-11-09 06:56:13,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8606770833333334 [2024-11-09 06:56:13,354 INFO L175 Difference]: Start difference. First operand has 240 places, 235 transitions, 490 flow. Second operand 3 states and 661 transitions. [2024-11-09 06:56:13,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 532 flow [2024-11-09 06:56:13,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:13,359 INFO L231 Difference]: Finished difference. Result has 238 places, 233 transitions, 484 flow [2024-11-09 06:56:13,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=238, PETRI_TRANSITIONS=233} [2024-11-09 06:56:13,360 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2024-11-09 06:56:13,360 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 233 transitions, 484 flow [2024-11-09 06:56:13,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:13,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:13,361 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] [2024-11-09 06:56:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:56:13,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1196085300, now seen corresponding path program 1 times [2024-11-09 06:56:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496596385] [2024-11-09 06:56:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496596385] [2024-11-09 06:56:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496596385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:13,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:13,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767245122] [2024-11-09 06:56:13,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:13,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:13,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 256 [2024-11-09 06:56:13,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 233 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:13,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:13,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 256 [2024-11-09 06:56:13,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:14,014 INFO L124 PetriNetUnfolderBase]: 564/3800 cut-off events. [2024-11-09 06:56:14,014 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-09 06:56:14,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 3800 events. 564/3800 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 33926 event pairs, 552 based on Foata normal form. 0/3412 useless extension candidates. Maximal degree in co-relation 4775. Up to 957 conditions per place. [2024-11-09 06:56:14,048 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 26 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2024-11-09 06:56:14,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 232 transitions, 538 flow [2024-11-09 06:56:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2024-11-09 06:56:14,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8502604166666666 [2024-11-09 06:56:14,051 INFO L175 Difference]: Start difference. First operand has 238 places, 233 transitions, 484 flow. Second operand 3 states and 653 transitions. [2024-11-09 06:56:14,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 232 transitions, 538 flow [2024-11-09 06:56:14,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 232 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:56:14,058 INFO L231 Difference]: Finished difference. Result has 238 places, 232 transitions, 485 flow [2024-11-09 06:56:14,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=485, PETRI_PLACES=238, PETRI_TRANSITIONS=232} [2024-11-09 06:56:14,060 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -3 predicate places. [2024-11-09 06:56:14,061 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 232 transitions, 485 flow [2024-11-09 06:56:14,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:14,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:14,062 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] [2024-11-09 06:56:14,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:56:14,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:14,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1062347049, now seen corresponding path program 1 times [2024-11-09 06:56:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094551876] [2024-11-09 06:56:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094551876] [2024-11-09 06:56:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094551876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895504796] [2024-11-09 06:56:14,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:14,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:14,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 256 [2024-11-09 06:56:14,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 232 transitions, 485 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:14,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:14,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 256 [2024-11-09 06:56:14,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:22,454 INFO L124 PetriNetUnfolderBase]: 27083/64954 cut-off events. [2024-11-09 06:56:22,455 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2024-11-09 06:56:22,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107320 conditions, 64954 events. 27083/64954 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 726108 event pairs, 18139 based on Foata normal form. 0/60423 useless extension candidates. Maximal degree in co-relation 107281. Up to 37375 conditions per place. [2024-11-09 06:56:22,911 INFO L140 encePairwiseOnDemand]: 217/256 looper letters, 120 selfloop transitions, 134 changer transitions 0/414 dead transitions. [2024-11-09 06:56:22,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 414 transitions, 1362 flow [2024-11-09 06:56:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:56:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1245 transitions. [2024-11-09 06:56:22,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.810546875 [2024-11-09 06:56:22,915 INFO L175 Difference]: Start difference. First operand has 238 places, 232 transitions, 485 flow. Second operand 6 states and 1245 transitions. [2024-11-09 06:56:22,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 414 transitions, 1362 flow [2024-11-09 06:56:22,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 414 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:22,938 INFO L231 Difference]: Finished difference. Result has 246 places, 365 transitions, 1359 flow [2024-11-09 06:56:22,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1359, PETRI_PLACES=246, PETRI_TRANSITIONS=365} [2024-11-09 06:56:22,941 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 5 predicate places. [2024-11-09 06:56:22,941 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 365 transitions, 1359 flow [2024-11-09 06:56:22,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:22,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:22,945 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] [2024-11-09 06:56:22,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:56:22,945 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:22,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash 918036152, now seen corresponding path program 1 times [2024-11-09 06:56:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941809826] [2024-11-09 06:56:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941809826] [2024-11-09 06:56:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941809826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:23,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:56:23,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450376751] [2024-11-09 06:56:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:23,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:23,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:23,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 256 [2024-11-09 06:56:23,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 365 transitions, 1359 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:23,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:23,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 256 [2024-11-09 06:56:23,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:27,183 INFO L124 PetriNetUnfolderBase]: 10377/34063 cut-off events. [2024-11-09 06:56:27,184 INFO L125 PetriNetUnfolderBase]: For 5308/5785 co-relation queries the response was YES. [2024-11-09 06:56:27,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60238 conditions, 34063 events. 10377/34063 cut-off events. For 5308/5785 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 393695 event pairs, 4204 based on Foata normal form. 1/31230 useless extension candidates. Maximal degree in co-relation 60195. Up to 11276 conditions per place. [2024-11-09 06:56:27,451 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 30 selfloop transitions, 3 changer transitions 0/373 dead transitions. [2024-11-09 06:56:27,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 373 transitions, 1447 flow [2024-11-09 06:56:27,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2024-11-09 06:56:27,453 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736979166666666 [2024-11-09 06:56:27,454 INFO L175 Difference]: Start difference. First operand has 246 places, 365 transitions, 1359 flow. Second operand 3 states and 671 transitions. [2024-11-09 06:56:27,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 373 transitions, 1447 flow [2024-11-09 06:56:27,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 373 transitions, 1447 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:27,603 INFO L231 Difference]: Finished difference. Result has 249 places, 367 transitions, 1384 flow [2024-11-09 06:56:27,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1384, PETRI_PLACES=249, PETRI_TRANSITIONS=367} [2024-11-09 06:56:27,605 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 8 predicate places. [2024-11-09 06:56:27,606 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 367 transitions, 1384 flow [2024-11-09 06:56:27,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:27,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:27,607 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] [2024-11-09 06:56:27,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:56:27,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -666200619, now seen corresponding path program 1 times [2024-11-09 06:56:27,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:27,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47977157] [2024-11-09 06:56:27,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47977157] [2024-11-09 06:56:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47977157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:27,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:27,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:56:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974016684] [2024-11-09 06:56:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:27,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:27,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:27,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:56:27,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 256 [2024-11-09 06:56:27,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 367 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:27,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:27,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 256 [2024-11-09 06:56:27,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:31,098 INFO L124 PetriNetUnfolderBase]: 9976/30271 cut-off events. [2024-11-09 06:56:31,099 INFO L125 PetriNetUnfolderBase]: For 5161/5599 co-relation queries the response was YES. [2024-11-09 06:56:31,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56400 conditions, 30271 events. 9976/30271 cut-off events. For 5161/5599 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 336112 event pairs, 2877 based on Foata normal form. 0/28566 useless extension candidates. Maximal degree in co-relation 56356. Up to 10725 conditions per place. [2024-11-09 06:56:31,376 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 34 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-11-09 06:56:31,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 372 transitions, 1471 flow [2024-11-09 06:56:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-11-09 06:56:31,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8567708333333334 [2024-11-09 06:56:31,379 INFO L175 Difference]: Start difference. First operand has 249 places, 367 transitions, 1384 flow. Second operand 3 states and 658 transitions. [2024-11-09 06:56:31,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 372 transitions, 1471 flow [2024-11-09 06:56:31,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 372 transitions, 1468 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:56:31,520 INFO L231 Difference]: Finished difference. Result has 247 places, 365 transitions, 1387 flow [2024-11-09 06:56:31,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=247, PETRI_TRANSITIONS=365} [2024-11-09 06:56:31,521 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 6 predicate places. [2024-11-09 06:56:31,522 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 365 transitions, 1387 flow [2024-11-09 06:56:31,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:31,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:31,522 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] [2024-11-09 06:56:31,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:56:31,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:31,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1164571068, now seen corresponding path program 1 times [2024-11-09 06:56:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:31,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664243610] [2024-11-09 06:56:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:32,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664243610] [2024-11-09 06:56:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664243610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904007279] [2024-11-09 06:56:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:32,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:32,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:32,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 256 [2024-11-09 06:56:32,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 365 transitions, 1387 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:32,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:32,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 256 [2024-11-09 06:56:32,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:42,264 INFO L124 PetriNetUnfolderBase]: 35577/80673 cut-off events. [2024-11-09 06:56:42,265 INFO L125 PetriNetUnfolderBase]: For 33687/37279 co-relation queries the response was YES. [2024-11-09 06:56:42,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187284 conditions, 80673 events. 35577/80673 cut-off events. For 33687/37279 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 907583 event pairs, 7719 based on Foata normal form. 84/77047 useless extension candidates. Maximal degree in co-relation 187239. Up to 33919 conditions per place. [2024-11-09 06:56:42,960 INFO L140 encePairwiseOnDemand]: 208/256 looper letters, 463 selfloop transitions, 219 changer transitions 0/848 dead transitions. [2024-11-09 06:56:42,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 848 transitions, 4965 flow [2024-11-09 06:56:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:56:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:56:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1342 transitions. [2024-11-09 06:56:42,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8736979166666666 [2024-11-09 06:56:42,964 INFO L175 Difference]: Start difference. First operand has 247 places, 365 transitions, 1387 flow. Second operand 6 states and 1342 transitions. [2024-11-09 06:56:42,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 848 transitions, 4965 flow [2024-11-09 06:56:43,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 848 transitions, 4965 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:43,346 INFO L231 Difference]: Finished difference. Result has 257 places, 596 transitions, 3703 flow [2024-11-09 06:56:43,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3703, PETRI_PLACES=257, PETRI_TRANSITIONS=596} [2024-11-09 06:56:43,348 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, 16 predicate places. [2024-11-09 06:56:43,348 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 596 transitions, 3703 flow [2024-11-09 06:56:43,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:43,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:43,349 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:43,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:56:43,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1173917037, now seen corresponding path program 1 times [2024-11-09 06:56:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576187833] [2024-11-09 06:56:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:43,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576187833] [2024-11-09 06:56:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576187833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:43,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399699665] [2024-11-09 06:56:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:43,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:43,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:43,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:43,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:56:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:43,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:56:43,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:43,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:56:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399699665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:56:43,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:56:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:56:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82495410] [2024-11-09 06:56:43,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:56:43,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:56:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:56:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:56:43,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 256 [2024-11-09 06:56:43,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 596 transitions, 3703 flow. Second operand has 10 states, 10 states have (on average 212.2) internal successors, (2122), 10 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:43,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:43,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 256 [2024-11-09 06:56:43,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:51,524 INFO L124 PetriNetUnfolderBase]: 21570/55483 cut-off events. [2024-11-09 06:56:51,525 INFO L125 PetriNetUnfolderBase]: For 52183/55860 co-relation queries the response was YES. [2024-11-09 06:56:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151217 conditions, 55483 events. 21570/55483 cut-off events. For 52183/55860 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 614195 event pairs, 2519 based on Foata normal form. 596/54631 useless extension candidates. Maximal degree in co-relation 151167. Up to 19817 conditions per place. [2024-11-09 06:56:52,046 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 72 selfloop transitions, 9 changer transitions 0/606 dead transitions. [2024-11-09 06:56:52,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 606 transitions, 3877 flow [2024-11-09 06:56:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:56:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 06:56:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1971 transitions. [2024-11-09 06:56:52,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.85546875 [2024-11-09 06:56:52,051 INFO L175 Difference]: Start difference. First operand has 257 places, 596 transitions, 3703 flow. Second operand 9 states and 1971 transitions. [2024-11-09 06:56:52,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 606 transitions, 3877 flow [2024-11-09 06:56:53,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 606 transitions, 3859 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-09 06:56:53,042 INFO L231 Difference]: Finished difference. Result has 219 places, 550 transitions, 3603 flow [2024-11-09 06:56:53,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=3581, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3603, PETRI_PLACES=219, PETRI_TRANSITIONS=550} [2024-11-09 06:56:53,045 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -22 predicate places. [2024-11-09 06:56:53,045 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 550 transitions, 3603 flow [2024-11-09 06:56:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.2) internal successors, (2122), 10 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:53,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:53,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:56:53,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:56:53,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 06:56:53,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:56:53,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 966835269, now seen corresponding path program 1 times [2024-11-09 06:56:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754758146] [2024-11-09 06:56:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:53,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754758146] [2024-11-09 06:56:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754758146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:56:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:56:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037264139] [2024-11-09 06:56:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:53,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:56:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:56:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:54,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 256 [2024-11-09 06:56:54,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 550 transitions, 3603 flow. Second operand has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:54,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:54,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 256 [2024-11-09 06:56:54,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:57:04,045 INFO L124 PetriNetUnfolderBase]: 33630/74283 cut-off events. [2024-11-09 06:57:04,045 INFO L125 PetriNetUnfolderBase]: For 105292/112116 co-relation queries the response was YES. [2024-11-09 06:57:04,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242174 conditions, 74283 events. 33630/74283 cut-off events. For 105292/112116 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 776909 event pairs, 7086 based on Foata normal form. 451/73468 useless extension candidates. Maximal degree in co-relation 242123. Up to 46282 conditions per place. [2024-11-09 06:57:04,807 INFO L140 encePairwiseOnDemand]: 225/256 looper letters, 512 selfloop transitions, 252 changer transitions 0/889 dead transitions. [2024-11-09 06:57:04,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 889 transitions, 7465 flow [2024-11-09 06:57:04,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:57:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:57:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1180 transitions. [2024-11-09 06:57:04,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7682291666666666 [2024-11-09 06:57:04,811 INFO L175 Difference]: Start difference. First operand has 219 places, 550 transitions, 3603 flow. Second operand 6 states and 1180 transitions. [2024-11-09 06:57:04,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 889 transitions, 7465 flow [2024-11-09 06:57:05,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 889 transitions, 7442 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-09 06:57:05,921 INFO L231 Difference]: Finished difference. Result has 224 places, 800 transitions, 6736 flow [2024-11-09 06:57:05,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=3580, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6736, PETRI_PLACES=224, PETRI_TRANSITIONS=800} [2024-11-09 06:57:05,922 INFO L277 CegarLoopForPetriNet]: 241 programPoint places, -17 predicate places. [2024-11-09 06:57:05,922 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 800 transitions, 6736 flow [2024-11-09 06:57:05,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.33333333333334) internal successors, (992), 6 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:05,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:57:05,923 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, 1, 1, 1, 1, 1] [2024-11-09 06:57:05,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:57:05,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-09 06:57:05,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:05,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1589139369, now seen corresponding path program 1 times [2024-11-09 06:57:05,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:57:05,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531115162] [2024-11-09 06:57:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:57:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:57:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:57:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531115162] [2024-11-09 06:57:06,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531115162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:57:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9765107] [2024-11-09 06:57:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:06,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:57:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:57:06,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:57:06,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:57:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:06,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 06:57:06,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:06,723 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:57:06,724 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-11-09 06:57:06,826 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-11-09 06:57:06,862 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-11-09 06:57:06,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:06,907 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-11-09 06:57:06,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:06,965 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-11-09 06:57:07,189 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-11-09 06:57:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:57:07,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:09,519 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~nondet18#1|)))) (and (forall ((v_ArrVal_269 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet18#1| (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)))) (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet18#1|)) (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet18#1|)) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet18#1| (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))))))) is different from false [2024-11-09 06:57:09,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.cse1 (+ .cse2 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 (store (select |c_#race| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet18#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet18#1|)))) (and (forall ((v_ArrVal_269 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet18#1| (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse1))) (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet18#1|)) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet18#1| (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet18#1| (select (select (store .cse0 c_~g1~0.base v_ArrVal_269) |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse3))))))) is different from false [2024-11-09 06:57:11,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:11,725 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-11-09 06:57:11,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:11,739 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 115 treesize of output 35 [2024-11-09 06:57:11,754 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 06:57:11,755 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-11-09 06:57:11,764 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 06:57:11,765 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-11-09 06:57:11,773 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-09 06:57:11,774 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-11-09 06:57:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 6 trivial. 2 not checked. [2024-11-09 06:57:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9765107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:57:11,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:57:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-11-09 06:57:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562077135] [2024-11-09 06:57:11,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:57:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 06:57:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:57:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 06:57:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=434, Unknown=18, NotChecked=90, Total=650 [2024-11-09 06:57:11,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2024-11-09 06:57:11,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 800 transitions, 6736 flow. Second operand has 26 states, 26 states have (on average 120.88461538461539) internal successors, (3143), 26 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:11,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:57:11,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2024-11-09 06:57:11,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand