./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-12-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_safe-12-racy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d91b46fd69b3013c60bad92e46ce1ef1ddf2b09c97cd6d95697162ae1af201f2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:26:44,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:26:44,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:26:44,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:26:44,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:26:44,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:26:44,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:26:44,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:26:44,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:26:44,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:26:44,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:26:44,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:26:44,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:26:44,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:26:44,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:26:44,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:26:44,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:26:44,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:26:44,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:26:44,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:26:44,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:26:44,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:26:44,285 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:26:44,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:26:44,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:26:44,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:26:44,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:26:44,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:26:44,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:26:44,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:26:44,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:26:44,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:26:44,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:26:44,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:26:44,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:26:44,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:26:44,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:26:44,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:26:44,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:26:44,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:26:44,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:26:44,291 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d91b46fd69b3013c60bad92e46ce1ef1ddf2b09c97cd6d95697162ae1af201f2 [2024-11-19 05:26:44,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:26:44,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:26:44,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:26:44,520 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:26:44,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:26:44,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-12-racy.i [2024-11-19 05:26:46,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:26:46,492 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:26:46,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-12-racy.i [2024-11-19 05:26:46,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e763bbe/5520b4f24f77481dadf1648ad5b87d11/FLAG5520fc03b [2024-11-19 05:26:46,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e763bbe/5520b4f24f77481dadf1648ad5b87d11 [2024-11-19 05:26:46,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:26:46,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:26:46,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:26:46,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:26:46,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:26:46,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:26:46" (1/1) ... [2024-11-19 05:26:46,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f45ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:46, skipping insertion in model container [2024-11-19 05:26:46,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:26:46" (1/1) ... [2024-11-19 05:26:46,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:26:47,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:26:47,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:26:47,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:26:47,221 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:26:47,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47 WrapperNode [2024-11-19 05:26:47,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:26:47,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:26:47,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:26:47,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:26:47,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,270 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-11-19 05:26:47,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:26:47,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:26:47,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:26:47,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:26:47,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:26:47,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:26:47,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:26:47,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:26:47,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (1/1) ... [2024-11-19 05:26:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:26:47,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:26:47,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:26:47,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:26:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 05:26:47,418 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 05:26:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 05:26:47,419 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 05:26:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 05:26:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:26:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:26:47,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 05:26:47,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:26:47,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:26:47,421 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:26:47,546 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:26:47,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:26:47,792 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:26:47,793 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:26:47,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:26:47,842 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 05:26:47,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:26:47 BoogieIcfgContainer [2024-11-19 05:26:47,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:26:47,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:26:47,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:26:47,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:26:47,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:26:46" (1/3) ... [2024-11-19 05:26:47,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d68609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:26:47, skipping insertion in model container [2024-11-19 05:26:47,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:26:47" (2/3) ... [2024-11-19 05:26:47,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d68609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:26:47, skipping insertion in model container [2024-11-19 05:26:47,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:26:47" (3/3) ... [2024-11-19 05:26:47,850 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-12-racy.i [2024-11-19 05:26:47,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:26:47,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-19 05:26:47,864 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:26:47,914 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 05:26:47,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2024-11-19 05:26:47,995 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2024-11-19 05:26:47,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:48,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 186 events. 9/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 382 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2024-11-19 05:26:48,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2024-11-19 05:26:48,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2024-11-19 05:26:48,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:26:48,022 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@77edfe67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:26:48,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-19 05:26:48,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:26:48,027 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-19 05:26:48,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:48,027 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:48,028 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:48,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:48,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash 959234546, now seen corresponding path program 1 times [2024-11-19 05:26:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530565027] [2024-11-19 05:26:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:48,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530565027] [2024-11-19 05:26:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530565027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:48,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:48,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 05:26:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872655938] [2024-11-19 05:26:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 05:26:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 05:26:48,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 05:26:48,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2024-11-19 05:26:48,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 378 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:48,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2024-11-19 05:26:48,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:48,408 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2024-11-19 05:26:48,408 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:26:48,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 286 events. 9/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 931 event pairs, 2 based on Foata normal form. 12/248 useless extension candidates. Maximal degree in co-relation 270. Up to 11 conditions per place. [2024-11-19 05:26:48,414 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2024-11-19 05:26:48,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2024-11-19 05:26:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 05:26:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-19 05:26:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2024-11-19 05:26:48,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2024-11-19 05:26:48,428 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2024-11-19 05:26:48,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2024-11-19 05:26:48,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:48,435 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2024-11-19 05:26:48,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=346, PETRI_PLACES=173, PETRI_TRANSITIONS=171} [2024-11-19 05:26:48,441 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2024-11-19 05:26:48,441 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2024-11-19 05:26:48,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:48,442 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:48,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:26:48,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:48,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:48,444 INFO L85 PathProgramCache]: Analyzing trace with hash -529477545, now seen corresponding path program 1 times [2024-11-19 05:26:48,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:48,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714179664] [2024-11-19 05:26:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:48,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714179664] [2024-11-19 05:26:48,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714179664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:48,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871425712] [2024-11-19 05:26:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:48,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:48,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:48,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:48,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:48,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 171 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:48,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:48,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:48,663 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2024-11-19 05:26:48,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:48,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 366 events. 30/366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1651 event pairs, 8 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 436. Up to 41 conditions per place. [2024-11-19 05:26:48,670 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-19 05:26:48,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2024-11-19 05:26:48,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-19 05:26:48,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-19 05:26:48,673 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2024-11-19 05:26:48,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2024-11-19 05:26:48,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:26:48,677 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2024-11-19 05:26:48,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2024-11-19 05:26:48,678 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2024-11-19 05:26:48,678 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2024-11-19 05:26:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:48,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:48,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:26:48,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:48,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844589, now seen corresponding path program 1 times [2024-11-19 05:26:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276712352] [2024-11-19 05:26:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:48,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:48,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276712352] [2024-11-19 05:26:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276712352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:48,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213027268] [2024-11-19 05:26:48,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:48,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:48,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:48,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:48,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:48,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:48,785 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2024-11-19 05:26:48,785 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:26:48,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 222 events. 20/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 806 event pairs, 4 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2024-11-19 05:26:48,788 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-19 05:26:48,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2024-11-19 05:26:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-19 05:26:48,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-19 05:26:48,790 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2024-11-19 05:26:48,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2024-11-19 05:26:48,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:48,793 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2024-11-19 05:26:48,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2024-11-19 05:26:48,794 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-19 05:26:48,795 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2024-11-19 05:26:48,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,795 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:48,795 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:48,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:26:48,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:48,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:48,796 INFO L85 PathProgramCache]: Analyzing trace with hash -934832415, now seen corresponding path program 1 times [2024-11-19 05:26:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:48,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632010633] [2024-11-19 05:26:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:48,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:48,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632010633] [2024-11-19 05:26:48,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632010633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:48,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223380009] [2024-11-19 05:26:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:48,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:48,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:48,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:48,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:48,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:48,911 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2024-11-19 05:26:48,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:48,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1079 event pairs, 7 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 327. Up to 26 conditions per place. [2024-11-19 05:26:48,915 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-19 05:26:48,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2024-11-19 05:26:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-19 05:26:48,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-19 05:26:48,917 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2024-11-19 05:26:48,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2024-11-19 05:26:48,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:48,920 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2024-11-19 05:26:48,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2024-11-19 05:26:48,921 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2024-11-19 05:26:48,922 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2024-11-19 05:26:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:48,922 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:26:48,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:48,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1890395950, now seen corresponding path program 1 times [2024-11-19 05:26:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377786643] [2024-11-19 05:26:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:48,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:48,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377786643] [2024-11-19 05:26:48,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377786643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444733051] [2024-11-19 05:26:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:48,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:48,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-19 05:26:48,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:48,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:48,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-19 05:26:48,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,045 INFO L124 PetriNetUnfolderBase]: 49/479 cut-off events. [2024-11-19 05:26:49,045 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 479 events. 49/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2570 event pairs, 30 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 571. Up to 67 conditions per place. [2024-11-19 05:26:49,049 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-19 05:26:49,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 378 flow [2024-11-19 05:26:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-19 05:26:49,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-19 05:26:49,051 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 492 transitions. [2024-11-19 05:26:49,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 378 flow [2024-11-19 05:26:49,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,053 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 340 flow [2024-11-19 05:26:49,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2024-11-19 05:26:49,054 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -14 predicate places. [2024-11-19 05:26:49,054 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 340 flow [2024-11-19 05:26:49,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,055 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:26:49,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1023988735, now seen corresponding path program 1 times [2024-11-19 05:26:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800546798] [2024-11-19 05:26:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800546798] [2024-11-19 05:26:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800546798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648412160] [2024-11-19 05:26:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:49,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:49,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,134 INFO L124 PetriNetUnfolderBase]: 15/281 cut-off events. [2024-11-19 05:26:49,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 281 events. 15/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1018 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 319. Up to 15 conditions per place. [2024-11-19 05:26:49,137 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2024-11-19 05:26:49,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 364 flow [2024-11-19 05:26:49,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-19 05:26:49,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-19 05:26:49,140 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 340 flow. Second operand 3 states and 495 transitions. [2024-11-19 05:26:49,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 364 flow [2024-11-19 05:26:49,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,145 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2024-11-19 05:26:49,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2024-11-19 05:26:49,153 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2024-11-19 05:26:49,154 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2024-11-19 05:26:49,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,154 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:26:49,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1174888269, now seen corresponding path program 1 times [2024-11-19 05:26:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178347656] [2024-11-19 05:26:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178347656] [2024-11-19 05:26:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178347656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472870691] [2024-11-19 05:26:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:49,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:49,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,284 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2024-11-19 05:26:49,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 449 events. 37/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2214 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 517. Up to 32 conditions per place. [2024-11-19 05:26:49,287 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-11-19 05:26:49,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2024-11-19 05:26:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-19 05:26:49,289 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-19 05:26:49,290 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2024-11-19 05:26:49,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2024-11-19 05:26:49,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,292 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2024-11-19 05:26:49,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2024-11-19 05:26:49,293 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2024-11-19 05:26:49,294 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2024-11-19 05:26:49,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:26:49,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1742870495, now seen corresponding path program 1 times [2024-11-19 05:26:49,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338208751] [2024-11-19 05:26:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338208751] [2024-11-19 05:26:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338208751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808053218] [2024-11-19 05:26:49,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:49,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:49,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,394 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2024-11-19 05:26:49,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 20/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 753 event pairs, 10 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place. [2024-11-19 05:26:49,397 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-11-19 05:26:49,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2024-11-19 05:26:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-19 05:26:49,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-19 05:26:49,398 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2024-11-19 05:26:49,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2024-11-19 05:26:49,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,401 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2024-11-19 05:26:49,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=165, PETRI_TRANSITIONS=161} [2024-11-19 05:26:49,402 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2024-11-19 05:26:49,402 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2024-11-19 05:26:49,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:26:49,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1408283567, now seen corresponding path program 1 times [2024-11-19 05:26:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412859681] [2024-11-19 05:26:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412859681] [2024-11-19 05:26:49,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412859681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294474109] [2024-11-19 05:26:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-19 05:26:49,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-19 05:26:49,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,474 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events. [2024-11-19 05:26:49,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 412 events. 33/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1868 event pairs, 6 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 472. Up to 32 conditions per place. [2024-11-19 05:26:49,477 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2024-11-19 05:26:49,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2024-11-19 05:26:49,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-19 05:26:49,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-19 05:26:49,479 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions. [2024-11-19 05:26:49,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2024-11-19 05:26:49,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,481 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow [2024-11-19 05:26:49,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2024-11-19 05:26:49,482 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-19 05:26:49,482 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow [2024-11-19 05:26:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:26:49,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash 445824893, now seen corresponding path program 1 times [2024-11-19 05:26:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089913077] [2024-11-19 05:26:49,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089913077] [2024-11-19 05:26:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089913077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436056746] [2024-11-19 05:26:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-19 05:26:49,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-19 05:26:49,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,553 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events. [2024-11-19 05:26:49,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 360 events. 31/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1470 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 426. Up to 32 conditions per place. [2024-11-19 05:26:49,556 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2024-11-19 05:26:49,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow [2024-11-19 05:26:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-19 05:26:49,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-19 05:26:49,559 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions. [2024-11-19 05:26:49,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow [2024-11-19 05:26:49,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,561 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow [2024-11-19 05:26:49,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-19 05:26:49,562 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-19 05:26:49,563 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow [2024-11-19 05:26:49,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:26:49,563 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1193293355, now seen corresponding path program 1 times [2024-11-19 05:26:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561778801] [2024-11-19 05:26:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561778801] [2024-11-19 05:26:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561778801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607467048] [2024-11-19 05:26:49,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:49,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:49,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,655 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2024-11-19 05:26:49,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 266 events. 15/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 920 event pairs, 6 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 306. Up to 25 conditions per place. [2024-11-19 05:26:49,658 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-19 05:26:49,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow [2024-11-19 05:26:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-19 05:26:49,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-19 05:26:49,660 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions. [2024-11-19 05:26:49,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow [2024-11-19 05:26:49,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,663 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow [2024-11-19 05:26:49,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-19 05:26:49,663 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-19 05:26:49,664 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow [2024-11-19 05:26:49,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,664 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:26:49,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash 215393162, now seen corresponding path program 1 times [2024-11-19 05:26:49,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849931071] [2024-11-19 05:26:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849931071] [2024-11-19 05:26:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849931071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19215156] [2024-11-19 05:26:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-19 05:26:49,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-19 05:26:49,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,754 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2024-11-19 05:26:49,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 436 events. 41/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2170 event pairs, 22 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 512. Up to 51 conditions per place. [2024-11-19 05:26:49,758 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-19 05:26:49,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow [2024-11-19 05:26:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-19 05:26:49,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-19 05:26:49,759 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions. [2024-11-19 05:26:49,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow [2024-11-19 05:26:49,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,762 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow [2024-11-19 05:26:49,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2024-11-19 05:26:49,763 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-19 05:26:49,763 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow [2024-11-19 05:26:49,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,763 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:26:49,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1089341189, now seen corresponding path program 1 times [2024-11-19 05:26:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540734811] [2024-11-19 05:26:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540734811] [2024-11-19 05:26:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540734811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:26:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922873431] [2024-11-19 05:26:49,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-19 05:26:49,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-19 05:26:49,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,861 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2024-11-19 05:26:49,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 550 events. 25/550 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2286 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 611. Up to 21 conditions per place. [2024-11-19 05:26:49,865 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-11-19 05:26:49,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow [2024-11-19 05:26:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-19 05:26:49,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-19 05:26:49,867 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions. [2024-11-19 05:26:49,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow [2024-11-19 05:26:49,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:49,870 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow [2024-11-19 05:26:49,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-19 05:26:49,871 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-19 05:26:49,871 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow [2024-11-19 05:26:49,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:49,872 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:49,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:26:49,872 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -800692820, now seen corresponding path program 1 times [2024-11-19 05:26:49,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:49,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425590274] [2024-11-19 05:26:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:49,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425590274] [2024-11-19 05:26:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425590274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:49,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632205362] [2024-11-19 05:26:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:49,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:49,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-19 05:26:49,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:49,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:49,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-19 05:26:49,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:49,987 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2024-11-19 05:26:49,987 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:26:49,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 584 events. 65/584 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place. [2024-11-19 05:26:49,996 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-19 05:26:49,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow [2024-11-19 05:26:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-19 05:26:50,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-19 05:26:50,002 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions. [2024-11-19 05:26:50,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow [2024-11-19 05:26:50,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:26:50,009 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2024-11-19 05:26:50,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-11-19 05:26:50,010 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-19 05:26:50,011 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2024-11-19 05:26:50,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:50,011 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:50,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:26:50,011 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:50,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash 809008106, now seen corresponding path program 1 times [2024-11-19 05:26:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500127314] [2024-11-19 05:26:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:50,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500127314] [2024-11-19 05:26:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500127314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902897490] [2024-11-19 05:26:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:50,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:50,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-19 05:26:50,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:50,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-19 05:26:50,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:50,291 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2024-11-19 05:26:50,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:50,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 554 events. 49/554 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2407 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 651. Up to 40 conditions per place. [2024-11-19 05:26:50,301 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-19 05:26:50,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2024-11-19 05:26:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-19 05:26:50,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2024-11-19 05:26:50,307 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2024-11-19 05:26:50,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2024-11-19 05:26:50,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:50,313 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2024-11-19 05:26:50,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2024-11-19 05:26:50,315 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-19 05:26:50,315 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2024-11-19 05:26:50,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:50,316 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:26:50,316 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:50,317 INFO L85 PathProgramCache]: Analyzing trace with hash 654170415, now seen corresponding path program 1 times [2024-11-19 05:26:50,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429158229] [2024-11-19 05:26:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:50,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429158229] [2024-11-19 05:26:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429158229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:50,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:50,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262876579] [2024-11-19 05:26:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:50,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:50,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:50,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:50,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:50,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-19 05:26:50,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:50,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-19 05:26:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:50,599 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2024-11-19 05:26:50,599 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 05:26:50,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 572 events. 69/572 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2880 event pairs, 42 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 733. Up to 91 conditions per place. [2024-11-19 05:26:50,612 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-11-19 05:26:50,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2024-11-19 05:26:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-19 05:26:50,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-19 05:26:50,614 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2024-11-19 05:26:50,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2024-11-19 05:26:50,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:26:50,622 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2024-11-19 05:26:50,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-11-19 05:26:50,623 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-19 05:26:50,626 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2024-11-19 05:26:50,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:50,627 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:50,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:26:50,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:50,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 308719358, now seen corresponding path program 1 times [2024-11-19 05:26:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:50,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742972334] [2024-11-19 05:26:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742972334] [2024-11-19 05:26:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742972334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:26:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:26:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129508902] [2024-11-19 05:26:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:26:50,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-19 05:26:50,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:50,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-19 05:26:50,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:50,887 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2024-11-19 05:26:50,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 556 events. 57/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2543 event pairs, 38 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 705. Up to 83 conditions per place. [2024-11-19 05:26:50,890 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-11-19 05:26:50,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2024-11-19 05:26:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-19 05:26:50,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-19 05:26:50,892 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2024-11-19 05:26:50,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2024-11-19 05:26:50,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:50,894 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2024-11-19 05:26:50,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2024-11-19 05:26:50,895 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-19 05:26:50,895 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2024-11-19 05:26:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:50,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:50,895 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:50,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:26:50,896 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:50,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2042320711, now seen corresponding path program 1 times [2024-11-19 05:26:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:50,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962568448] [2024-11-19 05:26:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962568448] [2024-11-19 05:26:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962568448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:26:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066691944] [2024-11-19 05:26:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:50,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:26:50,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:26:50,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:26:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:51,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 05:26:51,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:26:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:26:51,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:26:51,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066691944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:51,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:26:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-19 05:26:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946931508] [2024-11-19 05:26:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:51,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:51,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:51,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:26:51,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-19 05:26:51,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:51,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:51,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-19 05:26:51,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:51,136 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2024-11-19 05:26:51,137 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:26:51,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 36/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1794 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 563. Up to 31 conditions per place. [2024-11-19 05:26:51,141 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-19 05:26:51,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2024-11-19 05:26:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-19 05:26:51,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2024-11-19 05:26:51,143 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2024-11-19 05:26:51,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2024-11-19 05:26:51,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:51,145 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2024-11-19 05:26:51,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-19 05:26:51,146 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-19 05:26:51,146 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2024-11-19 05:26:51,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:51,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:51,147 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:51,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:26:51,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 05:26:51,348 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:51,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash -222269459, now seen corresponding path program 1 times [2024-11-19 05:26:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:51,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551949149] [2024-11-19 05:26:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:51,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551949149] [2024-11-19 05:26:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551949149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:26:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154311863] [2024-11-19 05:26:51,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:51,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:51,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:26:51,418 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:26:51,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 05:26:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:51,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 05:26:51,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:26:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 05:26:51,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 05:26:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154311863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:26:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 05:26:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-19 05:26:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835519203] [2024-11-19 05:26:51,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:26:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:26:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:51,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:26:51,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:26:51,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-19 05:26:51,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:51,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:51,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-19 05:26:51,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:51,584 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2024-11-19 05:26:51,585 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2024-11-19 05:26:51,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 601 events. 78/601 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2732 event pairs, 0 based on Foata normal form. 8/564 useless extension candidates. Maximal degree in co-relation 865. Up to 59 conditions per place. [2024-11-19 05:26:51,590 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-19 05:26:51,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2024-11-19 05:26:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:26:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:26:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-11-19 05:26:51,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2024-11-19 05:26:51,592 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2024-11-19 05:26:51,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2024-11-19 05:26:51,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:51,594 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2024-11-19 05:26:51,594 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2024-11-19 05:26:51,595 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-19 05:26:51,595 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2024-11-19 05:26:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:51,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:51,596 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:51,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 05:26:51,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:51,800 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:51,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash -237909861, now seen corresponding path program 1 times [2024-11-19 05:26:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964609981] [2024-11-19 05:26:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964609981] [2024-11-19 05:26:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964609981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:26:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060860095] [2024-11-19 05:26:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:26:51,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:51,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:26:51,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:26:51,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 05:26:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:26:51,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:26:51,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:26:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:52,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:26:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060860095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:26:52,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:26:52,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:26:52,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572767915] [2024-11-19 05:26:52,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:26:52,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:26:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:52,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:26:52,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:26:52,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-19 05:26:52,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:52,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:52,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-19 05:26:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:52,422 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2024-11-19 05:26:52,423 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2024-11-19 05:26:52,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 1310 events. 242/1310 cut-off events. For 1036/1068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6597 event pairs, 13 based on Foata normal form. 16/1267 useless extension candidates. Maximal degree in co-relation 2346. Up to 138 conditions per place. [2024-11-19 05:26:52,437 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2024-11-19 05:26:52,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2024-11-19 05:26:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:26:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:26:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2024-11-19 05:26:52,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2024-11-19 05:26:52,442 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2024-11-19 05:26:52,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2024-11-19 05:26:52,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:26:52,447 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2024-11-19 05:26:52,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2024-11-19 05:26:52,448 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-19 05:26:52,448 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2024-11-19 05:26:52,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:52,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:52,449 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:52,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 05:26:52,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:52,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1218412197, now seen corresponding path program 2 times [2024-11-19 05:26:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:52,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141295791] [2024-11-19 05:26:52,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:26:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:52,673 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 05:26:52,674 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:26:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141295791] [2024-11-19 05:26:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141295791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:26:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862499943] [2024-11-19 05:26:52,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 05:26:52,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:52,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:26:52,936 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:26:52,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 05:26:53,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 05:26:53,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:26:53,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 05:26:53,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:26:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:53,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:26:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862499943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:26:53,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:26:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-19 05:26:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704605269] [2024-11-19 05:26:53,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:26:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 05:26:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 05:26:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-19 05:26:53,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-19 05:26:53,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 446 flow. Second operand has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:53,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:53,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-19 05:26:53,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:54,413 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2024-11-19 05:26:54,413 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2024-11-19 05:26:54,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2170 events. 402/2170 cut-off events. For 1539/1571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10604 event pairs, 13 based on Foata normal form. 26/2135 useless extension candidates. Maximal degree in co-relation 3911. Up to 218 conditions per place. [2024-11-19 05:26:54,439 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2024-11-19 05:26:54,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2024-11-19 05:26:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 05:26:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-19 05:26:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2024-11-19 05:26:54,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2024-11-19 05:26:54,447 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2024-11-19 05:26:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2024-11-19 05:26:54,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-19 05:26:54,455 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2024-11-19 05:26:54,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=570, PETRI_PLACES=196, PETRI_TRANSITIONS=182} [2024-11-19 05:26:54,456 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2024-11-19 05:26:54,456 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2024-11-19 05:26:54,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:54,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:54,458 INFO L204 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:54,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 05:26:54,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:54,663 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:54,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash 557794011, now seen corresponding path program 3 times [2024-11-19 05:26:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:54,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960548224] [2024-11-19 05:26:54,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 05:26:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:54,708 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-19 05:26:54,712 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:26:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:26:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960548224] [2024-11-19 05:26:55,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960548224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:26:55,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196544497] [2024-11-19 05:26:55,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 05:26:55,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:26:55,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:26:55,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:26:55,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 05:26:55,546 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-19 05:26:55,547 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:26:55,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 05:26:55,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:26:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:55,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:26:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:26:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196544497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:26:56,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:26:56,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-19 05:26:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981903309] [2024-11-19 05:26:56,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:26:56,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 05:26:56,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:26:56,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 05:26:56,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 05:26:56,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-19 05:26:56,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 570 flow. Second operand has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:56,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:26:56,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-19 05:26:56,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:26:58,275 INFO L124 PetriNetUnfolderBase]: 722/3890 cut-off events. [2024-11-19 05:26:58,276 INFO L125 PetriNetUnfolderBase]: For 4577/4609 co-relation queries the response was YES. [2024-11-19 05:26:58,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 3890 events. 722/3890 cut-off events. For 4577/4609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 18669 event pairs, 13 based on Foata normal form. 46/3875 useless extension candidates. Maximal degree in co-relation 7457. Up to 378 conditions per place. [2024-11-19 05:26:58,326 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 291 selfloop transitions, 45 changer transitions 0/477 dead transitions. [2024-11-19 05:26:58,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 477 transitions, 3078 flow [2024-11-19 05:26:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-19 05:26:58,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-19 05:26:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7321 transitions. [2024-11-19 05:26:58,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8653664302600473 [2024-11-19 05:26:58,341 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 45 states and 7321 transitions. [2024-11-19 05:26:58,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 477 transitions, 3078 flow [2024-11-19 05:26:58,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 477 transitions, 3038 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-19 05:26:58,355 INFO L231 Difference]: Finished difference. Result has 243 places, 207 transitions, 848 flow [2024-11-19 05:26:58,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=848, PETRI_PLACES=243, PETRI_TRANSITIONS=207} [2024-11-19 05:26:58,355 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 59 predicate places. [2024-11-19 05:26:58,355 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 207 transitions, 848 flow [2024-11-19 05:26:58,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:26:58,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:26:58,359 INFO L204 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:26:58,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 05:26:58,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 05:26:58,565 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:26:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:26:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash 178363133, now seen corresponding path program 4 times [2024-11-19 05:26:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:26:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260252055] [2024-11-19 05:26:58,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 05:26:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:26:58,647 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 05:26:58,648 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:27:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:27:00,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:27:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260252055] [2024-11-19 05:27:00,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260252055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:27:00,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265664609] [2024-11-19 05:27:00,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 05:27:00,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:27:00,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:27:00,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:27:00,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 05:27:00,435 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 05:27:00,435 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 05:27:00,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 05:27:00,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:27:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:27:00,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:27:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:27:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265664609] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:27:02,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:27:02,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 55 [2024-11-19 05:27:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38341137] [2024-11-19 05:27:02,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:27:02,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-19 05:27:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:27:02,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-19 05:27:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2024-11-19 05:27:02,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-19 05:27:02,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 848 flow. Second operand has 55 states, 55 states have (on average 161.1090909090909) internal successors, (8861), 55 states have internal predecessors, (8861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:27:02,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:27:02,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-19 05:27:02,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:27:07,348 INFO L124 PetriNetUnfolderBase]: 1162/6255 cut-off events. [2024-11-19 05:27:07,348 INFO L125 PetriNetUnfolderBase]: For 14226/14258 co-relation queries the response was YES. [2024-11-19 05:27:07,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12692 conditions, 6255 events. 1162/6255 cut-off events. For 14226/14258 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 29737 event pairs, 13 based on Foata normal form. 61/6255 useless extension candidates. Maximal degree in co-relation 12668. Up to 598 conditions per place. [2024-11-19 05:27:07,539 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 500 selfloop transitions, 78 changer transitions 0/719 dead transitions. [2024-11-19 05:27:07,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 719 transitions, 5318 flow [2024-11-19 05:27:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-19 05:27:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2024-11-19 05:27:07,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 12681 transitions. [2024-11-19 05:27:07,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8647708674304418 [2024-11-19 05:27:07,572 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 848 flow. Second operand 78 states and 12681 transitions. [2024-11-19 05:27:07,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 719 transitions, 5318 flow [2024-11-19 05:27:07,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 719 transitions, 5240 flow, removed 21 selfloop flow, removed 18 redundant places. [2024-11-19 05:27:07,634 INFO L231 Difference]: Finished difference. Result has 314 places, 241 transitions, 1302 flow [2024-11-19 05:27:07,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1302, PETRI_PLACES=314, PETRI_TRANSITIONS=241} [2024-11-19 05:27:07,636 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 130 predicate places. [2024-11-19 05:27:07,636 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 241 transitions, 1302 flow [2024-11-19 05:27:07,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 161.1090909090909) internal successors, (8861), 55 states have internal predecessors, (8861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:27:07,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:27:07,644 INFO L204 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:27:07,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 05:27:07,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:27:07,847 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:27:07,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:27:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1753150897, now seen corresponding path program 5 times [2024-11-19 05:27:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:27:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049635089] [2024-11-19 05:27:07,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 05:27:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:27:08,130 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2024-11-19 05:27:08,131 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 05:27:08,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:27:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:27:08,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:27:08,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:27:08,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-19 05:27:08,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-19 05:27:08,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-19 05:27:08,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-19 05:27:08,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-19 05:27:08,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2024-11-19 05:27:08,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-19 05:27:08,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-19 05:27:08,606 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-19 05:27:08,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:27:08,607 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:27:08,871 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:27:08,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:27:08,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:27:08 BasicIcfg [2024-11-19 05:27:08,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:27:08,876 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:27:08,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:27:08,876 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:27:08,876 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:26:47" (3/4) ... [2024-11-19 05:27:08,877 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 05:27:09,178 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:27:09,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:27:09,178 INFO L158 Benchmark]: Toolchain (without parser) took 22425.43ms. Allocated memory was 134.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 103.8MB in the beginning and 923.8MB in the end (delta: -820.0MB). Peak memory consumption was 483.9MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,178 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:27:09,179 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.69ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 103.6MB in the beginning and 132.7MB in the end (delta: -29.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.10ms. Allocated memory is still 180.4MB. Free memory was 132.7MB in the beginning and 130.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,179 INFO L158 Benchmark]: Boogie Preprocessor took 46.67ms. Allocated memory is still 180.4MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,179 INFO L158 Benchmark]: RCFGBuilder took 523.05ms. Allocated memory is still 180.4MB. Free memory was 128.5MB in the beginning and 105.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,179 INFO L158 Benchmark]: TraceAbstraction took 21030.49ms. Allocated memory was 180.4MB in the beginning and 641.7MB in the end (delta: 461.4MB). Free memory was 104.4MB in the beginning and 221.2MB in the end (delta: -116.8MB). Peak memory consumption was 435.8MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,180 INFO L158 Benchmark]: Witness Printer took 302.23ms. Allocated memory was 641.7MB in the beginning and 1.2GB in the end (delta: 551.6MB). Free memory was 221.2MB in the beginning and 923.8MB in the end (delta: -702.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2024-11-19 05:27:09,181 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.69ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 103.6MB in the beginning and 132.7MB in the end (delta: -29.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.10ms. Allocated memory is still 180.4MB. Free memory was 132.7MB in the beginning and 130.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.67ms. Allocated memory is still 180.4MB. Free memory was 130.6MB in the beginning and 128.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.05ms. Allocated memory is still 180.4MB. Free memory was 128.5MB in the beginning and 105.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21030.49ms. Allocated memory was 180.4MB in the beginning and 641.7MB in the end (delta: 461.4MB). Free memory was 104.4MB in the beginning and 221.2MB in the end (delta: -116.8MB). Peak memory consumption was 435.8MB. Max. memory is 16.1GB. * Witness Printer took 302.23ms. Allocated memory was 641.7MB in the beginning and 1.2GB in the end (delta: 551.6MB). Free memory was 221.2MB in the beginning and 923.8MB in the end (delta: -702.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, id1=-1, id2=0, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=17711, q=0, x=22] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=28657, q=0, x=23] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=121393, p=0, prev=46368, q=0, x=24] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=24] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=24] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=196418, p=0, prev=75025, q=0, x=25] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=25] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=25] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] COND FALSE 0 !(x < 26) VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=121393, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, correct=121393, cur=196418, i=1, id1=-1, id2=0, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, correct=121393, cur=196418, i=1, id1=-1, id2=0, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=2, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, arg={0:0}, argc=196510, correct=121393, cur=196418, i=2, id1=-1, id2=0, j=1, next=196418, p=0, prev=121393, q=0, x=26] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 240 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 24, TraceHistogramMax: 27, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1556 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1342 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1208 IncrementalHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 94 mSDtfsCounter, 1208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2716 GetRequests, 2478 SyntacticMatches, 11 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3769 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1302occurred in iteration=23, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 4499 NumberOfCodeBlocks, 4499 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 4661 ConstructedInterpolants, 0 QuantifiedInterpolants, 10505 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 05:27:09,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE