./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:52,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:52,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:32:52,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:52,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:52,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:52,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:52,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:52,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:52,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:52,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:52,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:52,743 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:52,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:52,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:52,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:52,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:52,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:52,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:52,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:52,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:52,746 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2025-02-08 05:32:52,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:52,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:52,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:52,980 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:52,980 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:52,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-02-08 05:32:54,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2f86c85c/43048ad28d6d444bbb5a9bd476047533/FLAGc555f105d [2025-02-08 05:32:54,696 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:54,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2025-02-08 05:32:54,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2f86c85c/43048ad28d6d444bbb5a9bd476047533/FLAGc555f105d [2025-02-08 05:32:54,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2f86c85c/43048ad28d6d444bbb5a9bd476047533 [2025-02-08 05:32:54,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:54,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:54,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:54,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:54,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:54,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:54" (1/1) ... [2025-02-08 05:32:54,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed16652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:54, skipping insertion in model container [2025-02-08 05:32:54,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:54" (1/1) ... [2025-02-08 05:32:54,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:55,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:55,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:55,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:55,697 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:55,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55 WrapperNode [2025-02-08 05:32:55,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:55,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:55,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:55,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:55,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,744 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 243 [2025-02-08 05:32:55,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:55,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:55,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:55,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:55,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:55,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:55,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:55,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:55,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (1/1) ... [2025-02-08 05:32:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:55,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:32:55,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:32:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:55,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:55,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:55,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:55,836 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:32:55,933 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:55,934 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:56,268 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:56,269 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:56,294 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:56,298 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:56,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:56 BoogieIcfgContainer [2025-02-08 05:32:56,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:56,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:56,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:56,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:56,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:54" (1/3) ... [2025-02-08 05:32:56,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128567a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:56, skipping insertion in model container [2025-02-08 05:32:56,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:55" (2/3) ... [2025-02-08 05:32:56,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128567a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:56, skipping insertion in model container [2025-02-08 05:32:56,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:56" (3/3) ... [2025-02-08 05:32:56,306 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2025-02-08 05:32:56,317 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:56,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.i that has 2 procedures, 273 locations, 1 initial locations, 1 loop locations, and 20 error locations. [2025-02-08 05:32:56,320 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:56,400 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 274 transitions, 552 flow [2025-02-08 05:32:56,530 INFO L124 PetriNetUnfolderBase]: 2/273 cut-off events. [2025-02-08 05:32:56,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:56,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 273 events. 2/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 275 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 203. Up to 2 conditions per place. [2025-02-08 05:32:56,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 274 transitions, 552 flow [2025-02-08 05:32:56,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 273 transitions, 549 flow [2025-02-08 05:32:56,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:56,564 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;@2376da2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:56,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 05:32:56,572 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:56,572 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-08 05:32:56,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:56,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:56,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:56,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:32:56,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 904156167, now seen corresponding path program 1 times [2025-02-08 05:32:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956378377] [2025-02-08 05:32:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:56,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:32:56,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:32:56,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:56,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:57,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956378377] [2025-02-08 05:32:57,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956378377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:57,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484309918] [2025-02-08 05:32:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:57,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:57,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:57,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:57,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 274 [2025-02-08 05:32:57,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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) [2025-02-08 05:32:57,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:57,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 274 [2025-02-08 05:32:57,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:58,190 INFO L124 PetriNetUnfolderBase]: 1377/5040 cut-off events. [2025-02-08 05:32:58,190 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:58,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7834 conditions, 5040 events. 1377/5040 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 37770 event pairs, 1344 based on Foata normal form. 36/4711 useless extension candidates. Maximal degree in co-relation 7737. Up to 2785 conditions per place. [2025-02-08 05:32:58,213 INFO L140 encePairwiseOnDemand]: 267/274 looper letters, 92 selfloop transitions, 5 changer transitions 0/271 dead transitions. [2025-02-08 05:32:58,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 271 transitions, 739 flow [2025-02-08 05:32:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1149 transitions. [2025-02-08 05:32:58,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.698905109489051 [2025-02-08 05:32:58,232 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 549 flow. Second operand 6 states and 1149 transitions. [2025-02-08 05:32:58,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 271 transitions, 739 flow [2025-02-08 05:32:58,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 271 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:58,240 INFO L231 Difference]: Finished difference. Result has 278 places, 271 transitions, 554 flow [2025-02-08 05:32:58,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=278, PETRI_TRANSITIONS=271} [2025-02-08 05:32:58,246 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 3 predicate places. [2025-02-08 05:32:58,248 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 271 transitions, 554 flow [2025-02-08 05:32:58,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.33333333333334) internal successors, (1058), 6 states have internal predecessors, (1058), 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) [2025-02-08 05:32:58,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:58,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:58,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:58,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:32:58,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1113965736, now seen corresponding path program 1 times [2025-02-08 05:32:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018796449] [2025-02-08 05:32:58,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:58,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:32:58,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:32:58,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:58,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:58,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:58,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018796449] [2025-02-08 05:32:58,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018796449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:58,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:58,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81607154] [2025-02-08 05:32:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:58,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:58,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:58,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:59,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 274 [2025-02-08 05:32:59,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 271 transitions, 554 flow. Second operand has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 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) [2025-02-08 05:32:59,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:59,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 274 [2025-02-08 05:32:59,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:59,894 INFO L124 PetriNetUnfolderBase]: 762/4119 cut-off events. [2025-02-08 05:32:59,894 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:59,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5703 conditions, 4119 events. 762/4119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 31720 event pairs, 460 based on Foata normal form. 0/3759 useless extension candidates. Maximal degree in co-relation 5656. Up to 1372 conditions per place. [2025-02-08 05:32:59,910 INFO L140 encePairwiseOnDemand]: 242/274 looper letters, 81 selfloop transitions, 90 changer transitions 0/371 dead transitions. [2025-02-08 05:32:59,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 371 transitions, 1096 flow [2025-02-08 05:32:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2025-02-08 05:32:59,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8424574209245742 [2025-02-08 05:32:59,913 INFO L175 Difference]: Start difference. First operand has 278 places, 271 transitions, 554 flow. Second operand 6 states and 1385 transitions. [2025-02-08 05:32:59,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 371 transitions, 1096 flow [2025-02-08 05:32:59,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 371 transitions, 1086 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:59,920 INFO L231 Difference]: Finished difference. Result has 282 places, 354 transitions, 1120 flow [2025-02-08 05:32:59,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1120, PETRI_PLACES=282, PETRI_TRANSITIONS=354} [2025-02-08 05:32:59,921 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 7 predicate places. [2025-02-08 05:32:59,921 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 354 transitions, 1120 flow [2025-02-08 05:32:59,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 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) [2025-02-08 05:32:59,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:59,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:59,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:32:59,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:32:59,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:59,923 INFO L85 PathProgramCache]: Analyzing trace with hash 912123669, now seen corresponding path program 1 times [2025-02-08 05:32:59,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:59,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955576250] [2025-02-08 05:32:59,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:59,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:59,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:32:59,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:32:59,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:59,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:33:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955576250] [2025-02-08 05:33:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955576250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885246312] [2025-02-08 05:33:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:00,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:00,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:00,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:00,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:00,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 274 [2025-02-08 05:33:00,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 354 transitions, 1120 flow. Second operand has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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) [2025-02-08 05:33:00,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:00,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 274 [2025-02-08 05:33:00,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:01,701 INFO L124 PetriNetUnfolderBase]: 2110/7468 cut-off events. [2025-02-08 05:33:01,701 INFO L125 PetriNetUnfolderBase]: For 1550/1554 co-relation queries the response was YES. [2025-02-08 05:33:01,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13898 conditions, 7468 events. 2110/7468 cut-off events. For 1550/1554 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 60622 event pairs, 1264 based on Foata normal form. 0/6849 useless extension candidates. Maximal degree in co-relation 13793. Up to 4041 conditions per place. [2025-02-08 05:33:01,728 INFO L140 encePairwiseOnDemand]: 233/274 looper letters, 187 selfloop transitions, 123 changer transitions 0/486 dead transitions. [2025-02-08 05:33:01,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 486 transitions, 2164 flow [2025-02-08 05:33:01,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1297 transitions. [2025-02-08 05:33:01,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7889294403892944 [2025-02-08 05:33:01,731 INFO L175 Difference]: Start difference. First operand has 282 places, 354 transitions, 1120 flow. Second operand 6 states and 1297 transitions. [2025-02-08 05:33:01,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 486 transitions, 2164 flow [2025-02-08 05:33:01,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 486 transitions, 2164 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:01,742 INFO L231 Difference]: Finished difference. Result has 291 places, 470 transitions, 2072 flow [2025-02-08 05:33:01,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2072, PETRI_PLACES=291, PETRI_TRANSITIONS=470} [2025-02-08 05:33:01,743 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 16 predicate places. [2025-02-08 05:33:01,743 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 470 transitions, 2072 flow [2025-02-08 05:33:01,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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) [2025-02-08 05:33:01,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:01,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:01,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:33:01,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:01,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash 139956436, now seen corresponding path program 1 times [2025-02-08 05:33:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099417608] [2025-02-08 05:33:01,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:01,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 05:33:01,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:33:01,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:01,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099417608] [2025-02-08 05:33:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099417608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:01,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:01,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597301343] [2025-02-08 05:33:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:01,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:01,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:02,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 274 [2025-02-08 05:33:02,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 470 transitions, 2072 flow. Second operand has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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) [2025-02-08 05:33:02,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:02,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 274 [2025-02-08 05:33:02,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:03,351 INFO L124 PetriNetUnfolderBase]: 2411/8412 cut-off events. [2025-02-08 05:33:03,351 INFO L125 PetriNetUnfolderBase]: For 3693/3703 co-relation queries the response was YES. [2025-02-08 05:33:03,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17863 conditions, 8412 events. 2411/8412 cut-off events. For 3693/3703 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 68827 event pairs, 1292 based on Foata normal form. 0/7767 useless extension candidates. Maximal degree in co-relation 17744. Up to 4366 conditions per place. [2025-02-08 05:33:03,386 INFO L140 encePairwiseOnDemand]: 233/274 looper letters, 299 selfloop transitions, 123 changer transitions 0/602 dead transitions. [2025-02-08 05:33:03,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 602 transitions, 3564 flow [2025-02-08 05:33:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1297 transitions. [2025-02-08 05:33:03,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7889294403892944 [2025-02-08 05:33:03,389 INFO L175 Difference]: Start difference. First operand has 291 places, 470 transitions, 2072 flow. Second operand 6 states and 1297 transitions. [2025-02-08 05:33:03,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 602 transitions, 3564 flow [2025-02-08 05:33:03,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 602 transitions, 3404 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:03,405 INFO L231 Difference]: Finished difference. Result has 300 places, 586 transitions, 3088 flow [2025-02-08 05:33:03,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3088, PETRI_PLACES=300, PETRI_TRANSITIONS=586} [2025-02-08 05:33:03,406 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 25 predicate places. [2025-02-08 05:33:03,406 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 586 transitions, 3088 flow [2025-02-08 05:33:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.66666666666666) internal successors, (1084), 6 states have internal predecessors, (1084), 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) [2025-02-08 05:33:03,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:03,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:03,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:33:03,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:03,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash 656854574, now seen corresponding path program 1 times [2025-02-08 05:33:03,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:03,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984734394] [2025-02-08 05:33:03,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:33:03,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:33:03,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:04,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:04,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984734394] [2025-02-08 05:33:04,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984734394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:04,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:04,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934242841] [2025-02-08 05:33:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:04,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:04,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:04,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:04,311 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 274 [2025-02-08 05:33:04,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 586 transitions, 3088 flow. Second operand has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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) [2025-02-08 05:33:04,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:04,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 274 [2025-02-08 05:33:04,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:05,518 INFO L124 PetriNetUnfolderBase]: 2735/9234 cut-off events. [2025-02-08 05:33:05,518 INFO L125 PetriNetUnfolderBase]: For 5327/5391 co-relation queries the response was YES. [2025-02-08 05:33:05,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21733 conditions, 9234 events. 2735/9234 cut-off events. For 5327/5391 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 76007 event pairs, 1246 based on Foata normal form. 0/8561 useless extension candidates. Maximal degree in co-relation 21601. Up to 4881 conditions per place. [2025-02-08 05:33:05,556 INFO L140 encePairwiseOnDemand]: 231/274 looper letters, 360 selfloop transitions, 180 changer transitions 0/769 dead transitions. [2025-02-08 05:33:05,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 769 transitions, 4756 flow [2025-02-08 05:33:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1344 transitions. [2025-02-08 05:33:05,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175182481751825 [2025-02-08 05:33:05,559 INFO L175 Difference]: Start difference. First operand has 300 places, 586 transitions, 3088 flow. Second operand 6 states and 1344 transitions. [2025-02-08 05:33:05,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 769 transitions, 4756 flow [2025-02-08 05:33:05,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 769 transitions, 4360 flow, removed 198 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:05,578 INFO L231 Difference]: Finished difference. Result has 310 places, 753 transitions, 4088 flow [2025-02-08 05:33:05,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2704, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4088, PETRI_PLACES=310, PETRI_TRANSITIONS=753} [2025-02-08 05:33:05,579 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 35 predicate places. [2025-02-08 05:33:05,579 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 753 transitions, 4088 flow [2025-02-08 05:33:05,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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) [2025-02-08 05:33:05,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:05,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:05,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:33:05,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:05,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash -652987854, now seen corresponding path program 1 times [2025-02-08 05:33:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:05,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187178281] [2025-02-08 05:33:05,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:05,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:33:05,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:33:05,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:05,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187178281] [2025-02-08 05:33:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187178281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:05,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:05,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:33:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791502520] [2025-02-08 05:33:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:05,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:33:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:05,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:33:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:33:06,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 274 [2025-02-08 05:33:06,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 753 transitions, 4088 flow. Second operand has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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) [2025-02-08 05:33:06,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:06,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 274 [2025-02-08 05:33:06,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:08,039 INFO L124 PetriNetUnfolderBase]: 3188/10579 cut-off events. [2025-02-08 05:33:08,040 INFO L125 PetriNetUnfolderBase]: For 8590/8681 co-relation queries the response was YES. [2025-02-08 05:33:08,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28025 conditions, 10579 events. 3188/10579 cut-off events. For 8590/8681 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 88671 event pairs, 1284 based on Foata normal form. 0/9884 useless extension candidates. Maximal degree in co-relation 27888. Up to 5368 conditions per place. [2025-02-08 05:33:08,115 INFO L140 encePairwiseOnDemand]: 231/274 looper letters, 513 selfloop transitions, 180 changer transitions 0/936 dead transitions. [2025-02-08 05:33:08,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 936 transitions, 6356 flow [2025-02-08 05:33:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:33:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:33:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1344 transitions. [2025-02-08 05:33:08,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8175182481751825 [2025-02-08 05:33:08,118 INFO L175 Difference]: Start difference. First operand has 310 places, 753 transitions, 4088 flow. Second operand 6 states and 1344 transitions. [2025-02-08 05:33:08,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 936 transitions, 6356 flow [2025-02-08 05:33:08,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 936 transitions, 6302 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:08,196 INFO L231 Difference]: Finished difference. Result has 320 places, 920 transitions, 5724 flow [2025-02-08 05:33:08,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=4034, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5724, PETRI_PLACES=320, PETRI_TRANSITIONS=920} [2025-02-08 05:33:08,201 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 45 predicate places. [2025-02-08 05:33:08,201 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 920 transitions, 5724 flow [2025-02-08 05:33:08,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 185.16666666666666) internal successors, (1111), 6 states have internal predecessors, (1111), 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) [2025-02-08 05:33:08,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:08,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:08,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:33:08,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:08,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1930452875, now seen corresponding path program 1 times [2025-02-08 05:33:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:08,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544138904] [2025-02-08 05:33:08,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:08,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:33:08,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:33:08,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:08,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:09,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:09,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544138904] [2025-02-08 05:33:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544138904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 05:33:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112863461] [2025-02-08 05:33:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:09,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:33:09,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:09,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:33:09,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:33:11,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-08 05:33:11,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 920 transitions, 5724 flow. Second operand has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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) [2025-02-08 05:33:11,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:11,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-08 05:33:11,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:15,119 INFO L124 PetriNetUnfolderBase]: 4094/12842 cut-off events. [2025-02-08 05:33:15,119 INFO L125 PetriNetUnfolderBase]: For 15892/16211 co-relation queries the response was YES. [2025-02-08 05:33:15,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38420 conditions, 12842 events. 4094/12842 cut-off events. For 15892/16211 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 106630 event pairs, 1266 based on Foata normal form. 147/12287 useless extension candidates. Maximal degree in co-relation 38271. Up to 4180 conditions per place. [2025-02-08 05:33:15,208 INFO L140 encePairwiseOnDemand]: 217/274 looper letters, 921 selfloop transitions, 276 changer transitions 0/1417 dead transitions. [2025-02-08 05:33:15,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1417 transitions, 11034 flow [2025-02-08 05:33:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-08 05:33:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-08 05:33:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5573 transitions. [2025-02-08 05:33:15,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6561101954320697 [2025-02-08 05:33:15,216 INFO L175 Difference]: Start difference. First operand has 320 places, 920 transitions, 5724 flow. Second operand 31 states and 5573 transitions. [2025-02-08 05:33:15,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1417 transitions, 11034 flow [2025-02-08 05:33:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1417 transitions, 10674 flow, removed 180 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:15,296 INFO L231 Difference]: Finished difference. Result has 375 places, 1027 transitions, 7336 flow [2025-02-08 05:33:15,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=5364, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=920, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7336, PETRI_PLACES=375, PETRI_TRANSITIONS=1027} [2025-02-08 05:33:15,299 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 100 predicate places. [2025-02-08 05:33:15,299 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 1027 transitions, 7336 flow [2025-02-08 05:33:15,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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) [2025-02-08 05:33:15,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:15,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:33:15,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash 576470047, now seen corresponding path program 2 times [2025-02-08 05:33:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479022632] [2025-02-08 05:33:15,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:33:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:15,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:33:15,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 92 of 93 statements. [2025-02-08 05:33:15,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:33:15,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:15,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:15,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479022632] [2025-02-08 05:33:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479022632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:15,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:15,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 05:33:15,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772084392] [2025-02-08 05:33:15,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:15,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:33:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:15,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:33:15,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:33:17,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-08 05:33:17,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1027 transitions, 7336 flow. Second operand has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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) [2025-02-08 05:33:17,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:17,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-08 05:33:17,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:21,299 INFO L124 PetriNetUnfolderBase]: 5087/15795 cut-off events. [2025-02-08 05:33:21,299 INFO L125 PetriNetUnfolderBase]: For 28886/29224 co-relation queries the response was YES. [2025-02-08 05:33:21,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52619 conditions, 15795 events. 5087/15795 cut-off events. For 28886/29224 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 136905 event pairs, 1291 based on Foata normal form. 37/15050 useless extension candidates. Maximal degree in co-relation 52444. Up to 2883 conditions per place. [2025-02-08 05:33:21,448 INFO L140 encePairwiseOnDemand]: 216/274 looper letters, 1340 selfloop transitions, 200 changer transitions 0/1760 dead transitions. [2025-02-08 05:33:21,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1760 transitions, 16170 flow [2025-02-08 05:33:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 05:33:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 05:33:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3968 transitions. [2025-02-08 05:33:21,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6582614465826144 [2025-02-08 05:33:21,455 INFO L175 Difference]: Start difference. First operand has 375 places, 1027 transitions, 7336 flow. Second operand 22 states and 3968 transitions. [2025-02-08 05:33:21,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1760 transitions, 16170 flow [2025-02-08 05:33:21,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 1760 transitions, 15960 flow, removed 64 selfloop flow, removed 5 redundant places. [2025-02-08 05:33:21,977 INFO L231 Difference]: Finished difference. Result has 405 places, 1171 transitions, 9473 flow [2025-02-08 05:33:21,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=7196, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1027, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9473, PETRI_PLACES=405, PETRI_TRANSITIONS=1171} [2025-02-08 05:33:21,981 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 130 predicate places. [2025-02-08 05:33:21,981 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 1171 transitions, 9473 flow [2025-02-08 05:33:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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) [2025-02-08 05:33:21,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:21,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:21,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:33:21,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:21,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1154841130, now seen corresponding path program 1 times [2025-02-08 05:33:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:21,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112966367] [2025-02-08 05:33:21,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:22,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 05:33:22,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:33:22,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:22,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112966367] [2025-02-08 05:33:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112966367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:22,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 05:33:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776177357] [2025-02-08 05:33:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:22,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:33:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:22,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:33:22,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:33:24,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-08 05:33:24,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 1171 transitions, 9473 flow. Second operand has 15 states, 15 states have (on average 160.8) internal successors, (2412), 15 states have internal predecessors, (2412), 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) [2025-02-08 05:33:24,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:24,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-08 05:33:24,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:28,547 INFO L124 PetriNetUnfolderBase]: 6141/18344 cut-off events. [2025-02-08 05:33:28,547 INFO L125 PetriNetUnfolderBase]: For 47738/48087 co-relation queries the response was YES. [2025-02-08 05:33:28,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67178 conditions, 18344 events. 6141/18344 cut-off events. For 47738/48087 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 162162 event pairs, 854 based on Foata normal form. 93/17679 useless extension candidates. Maximal degree in co-relation 66990. Up to 5066 conditions per place. [2025-02-08 05:33:28,668 INFO L140 encePairwiseOnDemand]: 222/274 looper letters, 1517 selfloop transitions, 209 changer transitions 0/1976 dead transitions. [2025-02-08 05:33:28,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 1976 transitions, 20179 flow [2025-02-08 05:33:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 05:33:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 05:33:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4005 transitions. [2025-02-08 05:33:28,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643994691439947 [2025-02-08 05:33:28,673 INFO L175 Difference]: Start difference. First operand has 405 places, 1171 transitions, 9473 flow. Second operand 22 states and 4005 transitions. [2025-02-08 05:33:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 1976 transitions, 20179 flow [2025-02-08 05:33:28,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 1976 transitions, 19908 flow, removed 109 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:28,966 INFO L231 Difference]: Finished difference. Result has 439 places, 1316 transitions, 11528 flow [2025-02-08 05:33:28,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=9270, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=11528, PETRI_PLACES=439, PETRI_TRANSITIONS=1316} [2025-02-08 05:33:28,968 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 164 predicate places. [2025-02-08 05:33:28,968 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 1316 transitions, 11528 flow [2025-02-08 05:33:28,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.8) internal successors, (2412), 15 states have internal predecessors, (2412), 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) [2025-02-08 05:33:28,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:28,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:33:28,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash -887971873, now seen corresponding path program 3 times [2025-02-08 05:33:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448241791] [2025-02-08 05:33:28,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:33:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:28,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:33:28,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 92 of 93 statements. [2025-02-08 05:33:28,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:33:28,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:29,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:29,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448241791] [2025-02-08 05:33:29,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448241791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:29,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:33:29,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 05:33:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172431198] [2025-02-08 05:33:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:29,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:33:29,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:29,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:33:29,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:33:31,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 274 [2025-02-08 05:33:31,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1316 transitions, 11528 flow. Second operand has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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) [2025-02-08 05:33:31,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:31,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 274 [2025-02-08 05:33:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:36,908 INFO L124 PetriNetUnfolderBase]: 7132/21279 cut-off events. [2025-02-08 05:33:36,908 INFO L125 PetriNetUnfolderBase]: For 65534/66286 co-relation queries the response was YES. [2025-02-08 05:33:37,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82873 conditions, 21279 events. 7132/21279 cut-off events. For 65534/66286 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 194226 event pairs, 1468 based on Foata normal form. 124/20479 useless extension candidates. Maximal degree in co-relation 82666. Up to 4103 conditions per place. [2025-02-08 05:33:37,155 INFO L140 encePairwiseOnDemand]: 216/274 looper letters, 1513 selfloop transitions, 248 changer transitions 0/2008 dead transitions. [2025-02-08 05:33:37,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 2008 transitions, 21332 flow [2025-02-08 05:33:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:33:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:33:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3784 transitions. [2025-02-08 05:33:37,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6576294751477233 [2025-02-08 05:33:37,158 INFO L175 Difference]: Start difference. First operand has 439 places, 1316 transitions, 11528 flow. Second operand 21 states and 3784 transitions. [2025-02-08 05:33:37,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 2008 transitions, 21332 flow [2025-02-08 05:33:37,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 2008 transitions, 21226 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-02-08 05:33:37,676 INFO L231 Difference]: Finished difference. Result has 471 places, 1430 transitions, 14084 flow [2025-02-08 05:33:37,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=11473, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1085, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14084, PETRI_PLACES=471, PETRI_TRANSITIONS=1430} [2025-02-08 05:33:37,678 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 196 predicate places. [2025-02-08 05:33:37,678 INFO L471 AbstractCegarLoop]: Abstraction has has 471 places, 1430 transitions, 14084 flow [2025-02-08 05:33:37,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 160.86666666666667) internal successors, (2413), 15 states have internal predecessors, (2413), 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) [2025-02-08 05:33:37,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:37,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:37,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:33:37,679 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:37,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -825538000, now seen corresponding path program 2 times [2025-02-08 05:33:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197198039] [2025-02-08 05:33:37,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:33:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:37,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:33:37,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:33:37,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:33:37,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197198039] [2025-02-08 05:33:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197198039] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861660236] [2025-02-08 05:33:38,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:33:38,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:38,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:38,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:33:38,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:33:38,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:33:38,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:33:38,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:33:38,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:38,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 05:33:38,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:38,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:33:38,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:38,753 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 [2025-02-08 05:33:38,924 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 11 treesize of output 7 [2025-02-08 05:33:38,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 05:33:39,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-08 05:33:39,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-02-08 05:33:39,170 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 37 treesize of output 26 [2025-02-08 05:33:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:39,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:33:39,229 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_756 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)))) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) (+ 3 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|))) is different from false [2025-02-08 05:33:39,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_756 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)))) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-02-08 05:33:39,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|) .cse2 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_756 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) .cse2))) (forall ((v_ArrVal_756 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_756) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-02-08 05:33:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861660236] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:33:41,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:33:41,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-02-08 05:33:41,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104447964] [2025-02-08 05:33:41,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:33:41,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 05:33:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:41,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 05:33:41,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=660, Unknown=3, NotChecked=162, Total=930 [2025-02-08 05:33:41,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 274 [2025-02-08 05:33:41,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 1430 transitions, 14084 flow. Second operand has 31 states, 31 states have (on average 98.70967741935483) internal successors, (3060), 31 states have internal predecessors, (3060), 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) [2025-02-08 05:33:41,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:41,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 274 [2025-02-08 05:33:41,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:54,269 INFO L124 PetriNetUnfolderBase]: 13867/34854 cut-off events. [2025-02-08 05:33:54,269 INFO L125 PetriNetUnfolderBase]: For 142964/143022 co-relation queries the response was YES. [2025-02-08 05:33:54,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143659 conditions, 34854 events. 13867/34854 cut-off events. For 142964/143022 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 310857 event pairs, 4303 based on Foata normal form. 63/33091 useless extension candidates. Maximal degree in co-relation 143424. Up to 13002 conditions per place. [2025-02-08 05:33:54,768 INFO L140 encePairwiseOnDemand]: 222/274 looper letters, 2085 selfloop transitions, 223 changer transitions 0/2427 dead transitions. [2025-02-08 05:33:54,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 2427 transitions, 27977 flow [2025-02-08 05:33:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 05:33:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-02-08 05:33:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2953 transitions. [2025-02-08 05:33:54,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4685814027292923 [2025-02-08 05:33:54,771 INFO L175 Difference]: Start difference. First operand has 471 places, 1430 transitions, 14084 flow. Second operand 23 states and 2953 transitions. [2025-02-08 05:33:54,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 2427 transitions, 27977 flow [2025-02-08 05:33:55,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 2427 transitions, 27539 flow, removed 152 selfloop flow, removed 6 redundant places. [2025-02-08 05:33:55,941 INFO L231 Difference]: Finished difference. Result has 502 places, 1555 transitions, 16295 flow [2025-02-08 05:33:55,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=13709, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16295, PETRI_PLACES=502, PETRI_TRANSITIONS=1555} [2025-02-08 05:33:55,943 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 227 predicate places. [2025-02-08 05:33:55,943 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 1555 transitions, 16295 flow [2025-02-08 05:33:55,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 98.70967741935483) internal successors, (3060), 31 states have internal predecessors, (3060), 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) [2025-02-08 05:33:55,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:55,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:55,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:33:56,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 05:33:56,149 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:33:56,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -615561441, now seen corresponding path program 4 times [2025-02-08 05:33:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898210861] [2025-02-08 05:33:56,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:33:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:56,162 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:33:56,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-02-08 05:33:56,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:33:56,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:56,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:56,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898210861] [2025-02-08 05:33:56,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898210861] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:56,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246885225] [2025-02-08 05:33:56,587 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:33:56,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:56,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:56,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:33:56,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:33:56,677 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:33:56,705 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 87 of 93 statements. [2025-02-08 05:33:56,705 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:33:56,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:56,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 05:33:56,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:56,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:33:56,723 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:56,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 [2025-02-08 05:33:56,743 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 11 treesize of output 7 [2025-02-08 05:33:56,749 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 21 treesize of output 20 [2025-02-08 05:33:56,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:56,758 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 30 treesize of output 32 [2025-02-08 05:33:56,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:56,768 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 39 treesize of output 44 [2025-02-08 05:33:56,781 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 43 treesize of output 32 [2025-02-08 05:33:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:33:56,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:33:56,815 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_919 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_919 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1))))) is different from false [2025-02-08 05:33:56,831 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_919 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_919 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_919) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false [2025-02-08 05:34:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:34:08,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246885225] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:34:08,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:34:08,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2025-02-08 05:34:08,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721872379] [2025-02-08 05:34:08,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:34:08,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 05:34:08,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:08,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 05:34:08,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=249, Unknown=12, NotChecked=66, Total=380 [2025-02-08 05:34:08,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 274 [2025-02-08 05:34:08,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1555 transitions, 16295 flow. Second operand has 20 states, 20 states have (on average 101.2) internal successors, (2024), 20 states have internal predecessors, (2024), 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) [2025-02-08 05:34:08,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:08,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 274 [2025-02-08 05:34:08,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:34:22,347 INFO L124 PetriNetUnfolderBase]: 15522/38860 cut-off events. [2025-02-08 05:34:22,348 INFO L125 PetriNetUnfolderBase]: For 187779/187855 co-relation queries the response was YES. [2025-02-08 05:34:22,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168683 conditions, 38860 events. 15522/38860 cut-off events. For 187779/187855 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 355927 event pairs, 3526 based on Foata normal form. 65/36989 useless extension candidates. Maximal degree in co-relation 168433. Up to 19955 conditions per place. [2025-02-08 05:34:23,131 INFO L140 encePairwiseOnDemand]: 216/274 looper letters, 2079 selfloop transitions, 277 changer transitions 0/2472 dead transitions. [2025-02-08 05:34:23,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 2472 transitions, 29331 flow [2025-02-08 05:34:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:34:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:34:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2734 transitions. [2025-02-08 05:34:23,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4751477233229058 [2025-02-08 05:34:23,135 INFO L175 Difference]: Start difference. First operand has 502 places, 1555 transitions, 16295 flow. Second operand 21 states and 2734 transitions. [2025-02-08 05:34:23,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 2472 transitions, 29331 flow [2025-02-08 05:34:25,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 2472 transitions, 29066 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-02-08 05:34:25,077 INFO L231 Difference]: Finished difference. Result has 529 places, 1666 transitions, 19115 flow [2025-02-08 05:34:25,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=16082, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=19115, PETRI_PLACES=529, PETRI_TRANSITIONS=1666} [2025-02-08 05:34:25,078 INFO L279 CegarLoopForPetriNet]: 275 programPoint places, 254 predicate places. [2025-02-08 05:34:25,078 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 1666 transitions, 19115 flow [2025-02-08 05:34:25,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 101.2) internal successors, (2024), 20 states have internal predecessors, (2024), 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) [2025-02-08 05:34:25,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:34:25,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:34:25,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:34:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:34:25,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-08 05:34:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:34:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1603546800, now seen corresponding path program 3 times [2025-02-08 05:34:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:34:25,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852883907] [2025-02-08 05:34:25,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:34:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:34:25,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:34:25,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:34:25,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:34:25,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:34:25,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:34:25,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852883907] [2025-02-08 05:34:25,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852883907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:34:25,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706446899] [2025-02-08 05:34:25,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:34:25,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:34:25,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:34:25,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:34:25,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:34:25,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 2 equivalence classes. [2025-02-08 05:34:26,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 05:34:26,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:34:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:34:26,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 05:34:26,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:34:26,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:34:26,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:34:26,091 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 [2025-02-08 05:34:26,217 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 11 treesize of output 7 [2025-02-08 05:34:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 05:34:26,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-08 05:34:26,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-02-08 05:34:26,359 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 37 treesize of output 26 [2025-02-08 05:34:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:34:26,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:34:26,406 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) (+ 3 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|))) is different from false [2025-02-08 05:34:26,420 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet30#1|)) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-02-08 05:34:26,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse2 |c_ULTIMATE.start_init_#t~nondet30#1|) .cse1 |c_ULTIMATE.start_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1083 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_1083 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) .cse2))) (forall ((v_ArrVal_1083 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet30#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|))) (forall ((v_ArrVal_1083 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1083) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet30#1|))))) is different from false [2025-02-08 05:34:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:34:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706446899] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:34:28,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:34:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-02-08 05:34:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609984510] [2025-02-08 05:34:28,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:34:28,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-08 05:34:28,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:34:28,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-08 05:34:28,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=660, Unknown=3, NotChecked=162, Total=930 [2025-02-08 05:34:28,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 274 [2025-02-08 05:34:28,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 1666 transitions, 19115 flow. Second operand has 31 states, 31 states have (on average 98.70967741935483) internal successors, (3060), 31 states have internal predecessors, (3060), 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) [2025-02-08 05:34:28,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:34:28,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 274 [2025-02-08 05:34:28,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand