./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac87ea02e567b3a7b8d776dca629cbf95a8e96c66a18d3595c5975246bdc60a1 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:39,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:39,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:39,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:39,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:39,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:39,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:39,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:39,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:39,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:39,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:39,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:39,876 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:39,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:39,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:39,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:39,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:39,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:39,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:39,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:39,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:39,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:39,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:39,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:39,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:39,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:39,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:39,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:39,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:39,879 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/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 -> ac87ea02e567b3a7b8d776dca629cbf95a8e96c66a18d3595c5975246bdc60a1 [2025-04-29 11:10:40,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:40,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:40,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:40,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:40,103 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:40,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.c [2025-04-29 11:10:41,416 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e2fec40/ed8c5c82c9234b57b5ef17b3b0498fb3/FLAG217cd0e39 [2025-04-29 11:10:41,624 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:41,625 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.c [2025-04-29 11:10:41,626 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:41,626 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:41,630 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e2fec40/ed8c5c82c9234b57b5ef17b3b0498fb3/FLAG217cd0e39 [2025-04-29 11:10:42,467 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82e2fec40/ed8c5c82c9234b57b5ef17b3b0498fb3 [2025-04-29 11:10:42,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:42,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:42,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:42,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:42,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:42,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c4fbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42, skipping insertion in model container [2025-04-29 11:10:42,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:42,646 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:42,658 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:42,685 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:42,698 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:42,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42 WrapperNode [2025-04-29 11:10:42,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:42,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:42,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:42,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:42,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,732 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-04-29 11:10:42,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:42,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:42,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:42,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:42,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:42,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:42,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:42,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:42,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (1/1) ... [2025-04-29 11:10:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:42,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:10:42,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:10:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:10:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:10:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:10:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:10:42,824 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:10:42,880 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:42,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:43,040 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:43,041 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:43,050 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:43,051 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:43,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:43 BoogieIcfgContainer [2025-04-29 11:10:43,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:43,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:43,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:43,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:43,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:42" (1/3) ... [2025-04-29 11:10:43,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20550ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:43, skipping insertion in model container [2025-04-29 11:10:43,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:42" (2/3) ... [2025-04-29 11:10:43,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20550ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:43, skipping insertion in model container [2025-04-29 11:10:43,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:43" (3/3) ... [2025-04-29 11:10:43,060 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.c [2025-04-29 11:10:43,070 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:43,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-init.c that has 2 procedures, 86 locations, 87 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:10:43,074 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:43,122 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:43,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 183 flow [2025-04-29 11:10:43,207 INFO L116 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-04-29 11:10:43,210 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 180 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-04-29 11:10:43,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 88 transitions, 183 flow [2025-04-29 11:10:43,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 88 transitions, 183 flow [2025-04-29 11:10:43,221 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:43,228 INFO L340 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;@1c814cf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:43,228 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:10:43,239 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:43,239 INFO L116 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-04-29 11:10:43,239 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:43,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,239 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] [2025-04-29 11:10:43,240 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:43,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,246 INFO L85 PathProgramCache]: Analyzing trace with hash -36327866, now seen corresponding path program 1 times [2025-04-29 11:10:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192041345] [2025-04-29 11:10:43,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:10:43,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:10:43,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192041345] [2025-04-29 11:10:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192041345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532455929] [2025-04-29 11:10:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,014 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-04-29 11:10:44,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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-04-29 11:10:44,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-04-29 11:10:44,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,219 INFO L116 PetriNetUnfolderBase]: 91/418 cut-off events. [2025-04-29 11:10:44,220 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:10:44,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 418 events. 91/418 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1987 event pairs, 52 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 559. Up to 197 conditions per place. [2025-04-29 11:10:44,225 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 27 selfloop transitions, 22 changer transitions 1/108 dead transitions. [2025-04-29 11:10:44,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 108 transitions, 321 flow [2025-04-29 11:10:44,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2025-04-29 11:10:44,235 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2025-04-29 11:10:44,238 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 6 states and 405 transitions. [2025-04-29 11:10:44,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 108 transitions, 321 flow [2025-04-29 11:10:44,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 108 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:44,246 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 329 flow [2025-04-29 11:10:44,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-04-29 11:10:44,250 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2025-04-29 11:10:44,250 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 329 flow [2025-04-29 11:10:44,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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-04-29 11:10:44,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,251 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-04-29 11:10:44,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:44,251 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:44,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2066833404, now seen corresponding path program 1 times [2025-04-29 11:10:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977510285] [2025-04-29 11:10:44,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:10:44,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:10:44,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977510285] [2025-04-29 11:10:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977510285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575152212] [2025-04-29 11:10:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:44,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:44,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 88 [2025-04-29 11:10:44,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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-04-29 11:10:44,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 88 [2025-04-29 11:10:44,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,471 INFO L116 PetriNetUnfolderBase]: 40/253 cut-off events. [2025-04-29 11:10:44,471 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-29 11:10:44,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 253 events. 40/253 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 836 event pairs, 4 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 333. Up to 50 conditions per place. [2025-04-29 11:10:44,473 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 11 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2025-04-29 11:10:44,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 375 flow [2025-04-29 11:10:44,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2025-04-29 11:10:44,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8768939393939394 [2025-04-29 11:10:44,475 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 329 flow. Second operand 6 states and 463 transitions. [2025-04-29 11:10:44,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 375 flow [2025-04-29 11:10:44,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:44,480 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 347 flow [2025-04-29 11:10:44,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-04-29 11:10:44,481 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 18 predicate places. [2025-04-29 11:10:44,481 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 347 flow [2025-04-29 11:10:44,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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-04-29 11:10:44,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,481 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-04-29 11:10:44,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:44,482 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:44,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash 564644263, now seen corresponding path program 1 times [2025-04-29 11:10:44,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291852565] [2025-04-29 11:10:44,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:10:44,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:10:44,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291852565] [2025-04-29 11:10:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291852565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37106606] [2025-04-29 11:10:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:44,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,957 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-04-29 11:10:44,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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-04-29 11:10:44,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-04-29 11:10:44,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:45,049 INFO L116 PetriNetUnfolderBase]: 109/469 cut-off events. [2025-04-29 11:10:45,050 INFO L117 PetriNetUnfolderBase]: For 99/102 co-relation queries the response was YES. [2025-04-29 11:10:45,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 469 events. 109/469 cut-off events. For 99/102 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2308 event pairs, 36 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 886. Up to 225 conditions per place. [2025-04-29 11:10:45,054 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 46 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-04-29 11:10:45,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 557 flow [2025-04-29 11:10:45,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2025-04-29 11:10:45,058 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2025-04-29 11:10:45,058 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 347 flow. Second operand 6 states and 404 transitions. [2025-04-29 11:10:45,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 557 flow [2025-04-29 11:10:45,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 543 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:45,064 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 515 flow [2025-04-29 11:10:45,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2025-04-29 11:10:45,066 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2025-04-29 11:10:45,066 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 515 flow [2025-04-29 11:10:45,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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-04-29 11:10:45,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:45,066 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] [2025-04-29 11:10:45,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:45,066 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:45,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:45,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1755930662, now seen corresponding path program 1 times [2025-04-29 11:10:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:45,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885192748] [2025-04-29 11:10:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:45,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:45,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:10:45,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:10:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:45,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885192748] [2025-04-29 11:10:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885192748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19238637] [2025-04-29 11:10:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:45,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:45,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:45,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:45,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 88 [2025-04-29 11:10:45,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:45,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:45,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 88 [2025-04-29 11:10:45,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:45,599 INFO L116 PetriNetUnfolderBase]: 140/585 cut-off events. [2025-04-29 11:10:45,599 INFO L117 PetriNetUnfolderBase]: For 340/365 co-relation queries the response was YES. [2025-04-29 11:10:45,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 585 events. 140/585 cut-off events. For 340/365 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3046 event pairs, 14 based on Foata normal form. 4/562 useless extension candidates. Maximal degree in co-relation 1382. Up to 232 conditions per place. [2025-04-29 11:10:45,603 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 46 selfloop transitions, 57 changer transitions 8/176 dead transitions. [2025-04-29 11:10:45,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 963 flow [2025-04-29 11:10:45,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:45,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-04-29 11:10:45,606 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8977272727272727 [2025-04-29 11:10:45,606 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 515 flow. Second operand 6 states and 474 transitions. [2025-04-29 11:10:45,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 963 flow [2025-04-29 11:10:45,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 925 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:45,615 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 981 flow [2025-04-29 11:10:45,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2025-04-29 11:10:45,617 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 30 predicate places. [2025-04-29 11:10:45,617 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 981 flow [2025-04-29 11:10:45,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:45,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:45,618 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] [2025-04-29 11:10:45,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:45,619 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:45,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:45,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2028839114, now seen corresponding path program 1 times [2025-04-29 11:10:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:45,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645452947] [2025-04-29 11:10:45,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:45,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:10:45,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:10:45,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:45,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:45,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645452947] [2025-04-29 11:10:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645452947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:45,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056336485] [2025-04-29 11:10:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:45,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:45,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:45,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:45,999 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2025-04-29 11:10:46,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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-04-29 11:10:46,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:46,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2025-04-29 11:10:46,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:46,054 INFO L116 PetriNetUnfolderBase]: 125/536 cut-off events. [2025-04-29 11:10:46,054 INFO L117 PetriNetUnfolderBase]: For 653/670 co-relation queries the response was YES. [2025-04-29 11:10:46,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 536 events. 125/536 cut-off events. For 653/670 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2789 event pairs, 6 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 1501. Up to 135 conditions per place. [2025-04-29 11:10:46,057 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 55 selfloop transitions, 0 changer transitions 15/167 dead transitions. [2025-04-29 11:10:46,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1105 flow [2025-04-29 11:10:46,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 410 transitions. [2025-04-29 11:10:46,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7765151515151515 [2025-04-29 11:10:46,059 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 981 flow. Second operand 6 states and 410 transitions. [2025-04-29 11:10:46,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1105 flow [2025-04-29 11:10:46,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1069 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:46,065 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 908 flow [2025-04-29 11:10:46,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=115, PETRI_TRANSITIONS=152} [2025-04-29 11:10:46,066 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-04-29 11:10:46,066 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 908 flow [2025-04-29 11:10:46,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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-04-29 11:10:46,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:46,067 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:46,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:46,067 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:46,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash -944044830, now seen corresponding path program 1 times [2025-04-29 11:10:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:46,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646156714] [2025-04-29 11:10:46,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:46,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:10:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:46,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:46,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:46,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646156714] [2025-04-29 11:10:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646156714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:46,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:46,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:10:46,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923160898] [2025-04-29 11:10:46,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:46,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:46,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:46,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:46,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:10:47,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 88 [2025-04-29 11:10:47,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 152 transitions, 908 flow. Second operand has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 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-04-29 11:10:47,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:47,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 88 [2025-04-29 11:10:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:47,989 INFO L116 PetriNetUnfolderBase]: 209/704 cut-off events. [2025-04-29 11:10:47,989 INFO L117 PetriNetUnfolderBase]: For 901/916 co-relation queries the response was YES. [2025-04-29 11:10:47,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 704 events. 209/704 cut-off events. For 901/916 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3619 event pairs, 9 based on Foata normal form. 2/702 useless extension candidates. Maximal degree in co-relation 2382. Up to 301 conditions per place. [2025-04-29 11:10:47,994 INFO L140 encePairwiseOnDemand]: 70/88 looper letters, 128 selfloop transitions, 66 changer transitions 0/234 dead transitions. [2025-04-29 11:10:47,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 234 transitions, 1876 flow [2025-04-29 11:10:47,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:10:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:10:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 976 transitions. [2025-04-29 11:10:47,997 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6931818181818182 [2025-04-29 11:10:47,997 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 908 flow. Second operand 16 states and 976 transitions. [2025-04-29 11:10:47,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 234 transitions, 1876 flow [2025-04-29 11:10:48,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 234 transitions, 1874 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:48,012 INFO L231 Difference]: Finished difference. Result has 120 places, 193 transitions, 1495 flow [2025-04-29 11:10:48,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1495, PETRI_PLACES=120, PETRI_TRANSITIONS=193} [2025-04-29 11:10:48,012 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 31 predicate places. [2025-04-29 11:10:48,012 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 193 transitions, 1495 flow [2025-04-29 11:10:48,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 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-04-29 11:10:48,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:48,013 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:48,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:10:48,013 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:48,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1702008655, now seen corresponding path program 1 times [2025-04-29 11:10:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:48,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693297748] [2025-04-29 11:10:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:48,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:10:48,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:48,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:48,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:48,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693297748] [2025-04-29 11:10:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693297748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:48,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:48,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:10:48,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316987999] [2025-04-29 11:10:48,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:48,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:48,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:48,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:10:48,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2025-04-29 11:10:48,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 193 transitions, 1495 flow. Second operand has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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-04-29 11:10:48,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:48,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2025-04-29 11:10:48,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:49,327 INFO L116 PetriNetUnfolderBase]: 214/745 cut-off events. [2025-04-29 11:10:49,327 INFO L117 PetriNetUnfolderBase]: For 1786/1817 co-relation queries the response was YES. [2025-04-29 11:10:49,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 745 events. 214/745 cut-off events. For 1786/1817 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4023 event pairs, 15 based on Foata normal form. 4/748 useless extension candidates. Maximal degree in co-relation 2912. Up to 395 conditions per place. [2025-04-29 11:10:49,331 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 159 selfloop transitions, 37 changer transitions 0/241 dead transitions. [2025-04-29 11:10:49,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 241 transitions, 2231 flow [2025-04-29 11:10:49,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:10:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:10:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 911 transitions. [2025-04-29 11:10:49,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.739448051948052 [2025-04-29 11:10:49,334 INFO L175 Difference]: Start difference. First operand has 120 places, 193 transitions, 1495 flow. Second operand 14 states and 911 transitions. [2025-04-29 11:10:49,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 241 transitions, 2231 flow [2025-04-29 11:10:49,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 241 transitions, 2163 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:49,347 INFO L231 Difference]: Finished difference. Result has 139 places, 221 transitions, 1835 flow [2025-04-29 11:10:49,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1835, PETRI_PLACES=139, PETRI_TRANSITIONS=221} [2025-04-29 11:10:49,348 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 50 predicate places. [2025-04-29 11:10:49,348 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 221 transitions, 1835 flow [2025-04-29 11:10:49,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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-04-29 11:10:49,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:49,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:49,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:49,348 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:49,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1731609347, now seen corresponding path program 2 times [2025-04-29 11:10:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:49,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121362677] [2025-04-29 11:10:49,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:10:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:49,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:10:49,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:49,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:10:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:49,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:49,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121362677] [2025-04-29 11:10:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121362677] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:49,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:49,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:10:49,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516527517] [2025-04-29 11:10:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:49,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:49,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:49,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:10:50,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-04-29 11:10:50,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 221 transitions, 1835 flow. Second operand has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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-04-29 11:10:50,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:50,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-04-29 11:10:50,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:50,898 INFO L116 PetriNetUnfolderBase]: 237/838 cut-off events. [2025-04-29 11:10:50,898 INFO L117 PetriNetUnfolderBase]: For 2851/2890 co-relation queries the response was YES. [2025-04-29 11:10:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3568 conditions, 838 events. 237/838 cut-off events. For 2851/2890 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4793 event pairs, 14 based on Foata normal form. 8/845 useless extension candidates. Maximal degree in co-relation 3530. Up to 389 conditions per place. [2025-04-29 11:10:50,907 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 162 selfloop transitions, 77 changer transitions 0/292 dead transitions. [2025-04-29 11:10:50,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 292 transitions, 3005 flow [2025-04-29 11:10:50,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:10:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 11:10:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1435 transitions. [2025-04-29 11:10:50,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7412190082644629 [2025-04-29 11:10:50,911 INFO L175 Difference]: Start difference. First operand has 139 places, 221 transitions, 1835 flow. Second operand 22 states and 1435 transitions. [2025-04-29 11:10:50,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 292 transitions, 3005 flow [2025-04-29 11:10:50,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 292 transitions, 2927 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-04-29 11:10:50,931 INFO L231 Difference]: Finished difference. Result has 171 places, 273 transitions, 2575 flow [2025-04-29 11:10:50,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1801, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2575, PETRI_PLACES=171, PETRI_TRANSITIONS=273} [2025-04-29 11:10:50,933 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 82 predicate places. [2025-04-29 11:10:50,933 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 273 transitions, 2575 flow [2025-04-29 11:10:50,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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-04-29 11:10:50,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:50,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:50,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:10:50,934 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:50,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1866931733, now seen corresponding path program 3 times [2025-04-29 11:10:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:50,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932457180] [2025-04-29 11:10:50,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:10:50,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:50,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:10:50,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:50,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:10:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:51,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932457180] [2025-04-29 11:10:51,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932457180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:51,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:51,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:10:51,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843023429] [2025-04-29 11:10:51,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:51,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:51,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:51,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:10:51,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-04-29 11:10:51,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 273 transitions, 2575 flow. Second operand has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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-04-29 11:10:51,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:51,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-04-29 11:10:51,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:52,753 INFO L116 PetriNetUnfolderBase]: 253/906 cut-off events. [2025-04-29 11:10:52,753 INFO L117 PetriNetUnfolderBase]: For 3987/4026 co-relation queries the response was YES. [2025-04-29 11:10:52,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4179 conditions, 906 events. 253/906 cut-off events. For 3987/4026 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5361 event pairs, 13 based on Foata normal form. 11/915 useless extension candidates. Maximal degree in co-relation 4129. Up to 396 conditions per place. [2025-04-29 11:10:52,761 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 178 selfloop transitions, 107 changer transitions 0/338 dead transitions. [2025-04-29 11:10:52,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 338 transitions, 3901 flow [2025-04-29 11:10:52,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 11:10:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-29 11:10:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1558 transitions. [2025-04-29 11:10:52,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7376893939393939 [2025-04-29 11:10:52,766 INFO L175 Difference]: Start difference. First operand has 171 places, 273 transitions, 2575 flow. Second operand 24 states and 1558 transitions. [2025-04-29 11:10:52,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 338 transitions, 3901 flow [2025-04-29 11:10:52,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 338 transitions, 3778 flow, removed 49 selfloop flow, removed 4 redundant places. [2025-04-29 11:10:52,797 INFO L231 Difference]: Finished difference. Result has 205 places, 318 transitions, 3408 flow [2025-04-29 11:10:52,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3408, PETRI_PLACES=205, PETRI_TRANSITIONS=318} [2025-04-29 11:10:52,798 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 116 predicate places. [2025-04-29 11:10:52,798 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 318 transitions, 3408 flow [2025-04-29 11:10:52,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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-04-29 11:10:52,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:52,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:52,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:10:52,798 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:52,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -514610489, now seen corresponding path program 4 times [2025-04-29 11:10:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:52,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774780631] [2025-04-29 11:10:52,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:52,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:52,808 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:10:52,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-04-29 11:10:52,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:10:52,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:53,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:53,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774780631] [2025-04-29 11:10:53,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774780631] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:53,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:53,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:10:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890327219] [2025-04-29 11:10:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:53,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:53,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:53,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:10:53,722 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2025-04-29 11:10:53,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 318 transitions, 3408 flow. Second operand has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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-04-29 11:10:53,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:53,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2025-04-29 11:10:53,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:54,182 INFO L116 PetriNetUnfolderBase]: 270/969 cut-off events. [2025-04-29 11:10:54,182 INFO L117 PetriNetUnfolderBase]: For 5817/5919 co-relation queries the response was YES. [2025-04-29 11:10:54,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4904 conditions, 969 events. 270/969 cut-off events. For 5817/5919 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5974 event pairs, 13 based on Foata normal form. 24/992 useless extension candidates. Maximal degree in co-relation 4840. Up to 464 conditions per place. [2025-04-29 11:10:54,190 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 217 selfloop transitions, 101 changer transitions 0/363 dead transitions. [2025-04-29 11:10:54,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 363 transitions, 4661 flow [2025-04-29 11:10:54,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:10:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:10:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1098 transitions. [2025-04-29 11:10:54,193 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.733957219251337 [2025-04-29 11:10:54,193 INFO L175 Difference]: Start difference. First operand has 205 places, 318 transitions, 3408 flow. Second operand 17 states and 1098 transitions. [2025-04-29 11:10:54,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 363 transitions, 4661 flow [2025-04-29 11:10:54,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 363 transitions, 4481 flow, removed 40 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:54,231 INFO L231 Difference]: Finished difference. Result has 225 places, 342 transitions, 3983 flow [2025-04-29 11:10:54,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=3245, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3983, PETRI_PLACES=225, PETRI_TRANSITIONS=342} [2025-04-29 11:10:54,233 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 136 predicate places. [2025-04-29 11:10:54,233 INFO L485 AbstractCegarLoop]: Abstraction has has 225 places, 342 transitions, 3983 flow [2025-04-29 11:10:54,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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-04-29 11:10:54,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:54,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:54,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:10:54,233 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:54,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:54,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1702442771, now seen corresponding path program 5 times [2025-04-29 11:10:54,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:54,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254982764] [2025-04-29 11:10:54,234 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:10:54,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:54,244 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:10:54,251 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:54,251 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:10:54,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:54,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254982764] [2025-04-29 11:10:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254982764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:54,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:54,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:10:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002068093] [2025-04-29 11:10:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:54,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:54,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:54,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:10:55,048 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-04-29 11:10:55,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 342 transitions, 3983 flow. Second operand has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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-04-29 11:10:55,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:55,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-04-29 11:10:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:55,729 INFO L116 PetriNetUnfolderBase]: 414/1485 cut-off events. [2025-04-29 11:10:55,729 INFO L117 PetriNetUnfolderBase]: For 11348/11465 co-relation queries the response was YES. [2025-04-29 11:10:55,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7868 conditions, 1485 events. 414/1485 cut-off events. For 11348/11465 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10627 event pairs, 22 based on Foata normal form. 49/1532 useless extension candidates. Maximal degree in co-relation 7797. Up to 390 conditions per place. [2025-04-29 11:10:55,743 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 262 selfloop transitions, 189 changer transitions 0/504 dead transitions. [2025-04-29 11:10:55,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 504 transitions, 6971 flow [2025-04-29 11:10:55,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:10:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:10:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1345 transitions. [2025-04-29 11:10:55,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7642045454545454 [2025-04-29 11:10:55,745 INFO L175 Difference]: Start difference. First operand has 225 places, 342 transitions, 3983 flow. Second operand 20 states and 1345 transitions. [2025-04-29 11:10:55,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 504 transitions, 6971 flow [2025-04-29 11:10:55,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 504 transitions, 6866 flow, removed 23 selfloop flow, removed 7 redundant places. [2025-04-29 11:10:55,816 INFO L231 Difference]: Finished difference. Result has 247 places, 435 transitions, 5978 flow [2025-04-29 11:10:55,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=3889, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5978, PETRI_PLACES=247, PETRI_TRANSITIONS=435} [2025-04-29 11:10:55,817 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 158 predicate places. [2025-04-29 11:10:55,818 INFO L485 AbstractCegarLoop]: Abstraction has has 247 places, 435 transitions, 5978 flow [2025-04-29 11:10:55,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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-04-29 11:10:55,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:55,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:55,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:10:55,819 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:55,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1287420897, now seen corresponding path program 6 times [2025-04-29 11:10:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:55,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976351382] [2025-04-29 11:10:55,820 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:10:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:55,827 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:10:55,839 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:55,839 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-29 11:10:55,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:56,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976351382] [2025-04-29 11:10:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976351382] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:56,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898833123] [2025-04-29 11:10:56,223 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:10:56,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:56,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:56,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:10:56,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:10:56,272 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:10:56,321 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:10:56,321 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-29 11:10:56,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:56,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:10:56,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:10:56,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:10:56,488 INFO L354 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-04-29 11:10:56,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-04-29 11:10:56,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-04-29 11:10:56,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:10:56,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:10:56,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:10:56,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:10:56,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:56,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 47 [2025-04-29 11:10:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:10:56,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898833123] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:02,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:02,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2025-04-29 11:11:02,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712339675] [2025-04-29 11:11:02,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:02,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:11:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:02,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:11:02,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=777, Unknown=1, NotChecked=0, Total=930 [2025-04-29 11:11:08,683 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:10,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 88 [2025-04-29 11:11:10,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 435 transitions, 5978 flow. Second operand has 31 states, 31 states have (on average 47.354838709677416) internal successors, (1468), 31 states have internal predecessors, (1468), 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-04-29 11:11:10,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:10,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 88 [2025-04-29 11:11:10,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:13,400 INFO L116 PetriNetUnfolderBase]: 808/2550 cut-off events. [2025-04-29 11:11:13,400 INFO L117 PetriNetUnfolderBase]: For 24572/24582 co-relation queries the response was YES. [2025-04-29 11:11:13,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14459 conditions, 2550 events. 808/2550 cut-off events. For 24572/24582 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19958 event pairs, 123 based on Foata normal form. 7/2550 useless extension candidates. Maximal degree in co-relation 14377. Up to 938 conditions per place. [2025-04-29 11:11:13,423 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 433 selfloop transitions, 164 changer transitions 0/634 dead transitions. [2025-04-29 11:11:13,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 634 transitions, 9560 flow [2025-04-29 11:11:13,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:11:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-29 11:11:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1289 transitions. [2025-04-29 11:11:13,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5859090909090909 [2025-04-29 11:11:13,425 INFO L175 Difference]: Start difference. First operand has 247 places, 435 transitions, 5978 flow. Second operand 25 states and 1289 transitions. [2025-04-29 11:11:13,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 634 transitions, 9560 flow [2025-04-29 11:11:13,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 634 transitions, 9382 flow, removed 71 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:13,546 INFO L231 Difference]: Finished difference. Result has 280 places, 480 transitions, 7273 flow [2025-04-29 11:11:13,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=5808, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=7273, PETRI_PLACES=280, PETRI_TRANSITIONS=480} [2025-04-29 11:11:13,547 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 191 predicate places. [2025-04-29 11:11:13,547 INFO L485 AbstractCegarLoop]: Abstraction has has 280 places, 480 transitions, 7273 flow [2025-04-29 11:11:13,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 47.354838709677416) internal successors, (1468), 31 states have internal predecessors, (1468), 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-04-29 11:11:13,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:13,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:13,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:11:13,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:11:13,752 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:13,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash 606596483, now seen corresponding path program 7 times [2025-04-29 11:11:13,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:13,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884926392] [2025-04-29 11:11:13,753 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:11:13,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:13,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:11:13,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:11:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:13,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:14,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884926392] [2025-04-29 11:11:14,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884926392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:11:14,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947582422] [2025-04-29 11:11:14,176 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:11:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:11:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:14,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:11:14,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:11:14,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:11:14,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:11:14,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:14,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:14,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:11:14,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:11:14,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:11:14,330 INFO L354 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-04-29 11:11:14,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-04-29 11:11:14,455 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-04-29 11:11:14,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:14,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:14,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:14,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:11:14,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:11:14,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2025-04-29 11:11:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:14,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:11:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947582422] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:11:21,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:11:21,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2025-04-29 11:11:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614845536] [2025-04-29 11:11:21,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:11:21,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:11:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:21,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:11:21,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=780, Unknown=2, NotChecked=0, Total=930 [2025-04-29 11:11:26,210 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:29,211 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:32,204 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:35,094 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:37,677 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:40,445 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:44,615 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:47,155 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-29 11:11:48,752 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15