./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-11-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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-11-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 deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:10:47,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:10:48,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:10:48,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:10:48,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:10:48,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:10:48,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:10:48,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:10:48,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:10:48,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:10:48,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:10:48,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:10:48,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:10:48,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:10:48,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:10:48,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:10:48,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:10:48,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:10:48,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:10:48,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:10:48,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:10:48,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:10:48,073 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:10:48,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:10:48,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:10:48,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:10:48,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:10:48,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:10:48,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:10:48,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:10:48,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:10:48,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:10:48,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:10:48,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:10:48,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:10:48,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:10:48,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:10:48,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:10:48,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:10:48,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:10:48,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:10:48,080 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 -> deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 [2024-11-16 23:10:48,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:10:48,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:10:48,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:10:48,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:10:48,342 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:10:48,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-11-racy.i [2024-11-16 23:10:49,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:10:50,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:10:50,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-11-racy.i [2024-11-16 23:10:50,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48584d47/97a94d96d96945768c74872512bfc8f2/FLAG6e7f49d6d [2024-11-16 23:10:50,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48584d47/97a94d96d96945768c74872512bfc8f2 [2024-11-16 23:10:50,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:10:50,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:10:50,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:10:50,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:10:50,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:10:50,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a41eb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50, skipping insertion in model container [2024-11-16 23:10:50,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:10:50,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:10:50,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:10:50,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:10:50,622 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:10:50,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50 WrapperNode [2024-11-16 23:10:50,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:10:50,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:10:50,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:10:50,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:10:50,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,668 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2024-11-16 23:10:50,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:10:50,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:10:50,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:10:50,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:10:50,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,687 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:10:50,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:10:50,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:10:50,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:10:50,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (1/1) ... [2024-11-16 23:10:50,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:10:50,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:10:50,739 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-16 23:10:50,741 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-16 23:10:50,785 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-16 23:10:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-16 23:10:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-16 23:10:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-16 23:10:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 23:10:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:10:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:10:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 23:10:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:10:50,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:10:50,789 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:10:50,909 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:10:50,911 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:10:51,206 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:10:51,206 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:10:51,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:10:51,281 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:10:51,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:10:51 BoogieIcfgContainer [2024-11-16 23:10:51,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:10:51,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:10:51,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:10:51,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:10:51,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:10:50" (1/3) ... [2024-11-16 23:10:51,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3df6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:10:51, skipping insertion in model container [2024-11-16 23:10:51,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:50" (2/3) ... [2024-11-16 23:10:51,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3df6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:10:51, skipping insertion in model container [2024-11-16 23:10:51,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:10:51" (3/3) ... [2024-11-16 23:10:51,292 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-11-racy.i [2024-11-16 23:10:51,309 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:10:51,310 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-16 23:10:51,311 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:10:51,387 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 23:10:51,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2024-11-16 23:10:51,521 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2024-11-16 23:10:51,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:51,530 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 399 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-16 23:10:51,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2024-11-16 23:10:51,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2024-11-16 23:10:51,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:10:51,559 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;@713b9452, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:10:51,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-16 23:10:51,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:10:51,570 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-16 23:10:51,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:51,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:51,571 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-16 23:10:51,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:51,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1651682325, now seen corresponding path program 1 times [2024-11-16 23:10:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162219022] [2024-11-16 23:10:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:51,847 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-16 23:10:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:51,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162219022] [2024-11-16 23:10:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162219022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:51,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:51,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 23:10:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659905613] [2024-11-16 23:10:51,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:51,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:10:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:51,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:10:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:10:51,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2024-11-16 23:10:51,906 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-16 23:10:51,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:51,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2024-11-16 23:10:51,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:52,023 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2024-11-16 23:10:52,024 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:10:52,030 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 10. Compared 958 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-16 23:10:52,035 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2024-11-16 23:10:52,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2024-11-16 23:10:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:10:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 23:10:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2024-11-16 23:10:52,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2024-11-16 23:10:52,053 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2024-11-16 23:10:52,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2024-11-16 23:10:52,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:52,061 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2024-11-16 23:10:52,063 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-16 23:10:52,070 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2024-11-16 23:10:52,071 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2024-11-16 23:10:52,071 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-16 23:10:52,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:52,072 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-16 23:10:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:10:52,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1936525852, now seen corresponding path program 1 times [2024-11-16 23:10:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826479140] [2024-11-16 23:10:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:52,180 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-16 23:10:52,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:52,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826479140] [2024-11-16 23:10:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826479140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195047947] [2024-11-16 23:10:52,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:52,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:52,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:52,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:52,225 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-16 23:10:52,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:52,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:52,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:52,335 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2024-11-16 23:10:52,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:52,340 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 1659 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-16 23:10:52,344 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-16 23:10:52,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2024-11-16 23:10:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-16 23:10:52,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-16 23:10:52,351 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2024-11-16 23:10:52,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2024-11-16 23:10:52,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:10:52,359 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2024-11-16 23:10:52,359 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-16 23:10:52,360 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2024-11-16 23:10:52,360 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2024-11-16 23:10:52,361 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-16 23:10:52,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:52,361 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:10:52,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:10:52,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:52,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1040525924, now seen corresponding path program 1 times [2024-11-16 23:10:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429779054] [2024-11-16 23:10:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:52,447 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-16 23:10:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429779054] [2024-11-16 23:10:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429779054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:52,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123179185] [2024-11-16 23:10:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:52,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:52,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:52,479 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-16 23:10:52,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:52,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:52,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:52,534 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2024-11-16 23:10:52,536 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:10:52,538 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 811 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-16 23:10:52,541 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-16 23:10:52,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2024-11-16 23:10:52,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:52,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-16 23:10:52,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-16 23:10:52,545 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2024-11-16 23:10:52,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2024-11-16 23:10:52,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:52,550 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2024-11-16 23:10:52,553 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-16 23:10:52,553 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-16 23:10:52,554 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2024-11-16 23:10:52,554 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-16 23:10:52,554 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:52,554 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-16 23:10:52,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:10:52,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:52,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 817680713, now seen corresponding path program 1 times [2024-11-16 23:10:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:52,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59711607] [2024-11-16 23:10:52,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:52,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:52,624 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-16 23:10:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59711607] [2024-11-16 23:10:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59711607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562874918] [2024-11-16 23:10:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:52,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:52,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:52,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:52,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:52,654 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-16 23:10:52,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:52,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:52,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:52,705 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2024-11-16 23:10:52,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:52,708 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 1065 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-16 23:10:52,710 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-16 23:10:52,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2024-11-16 23:10:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:52,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-16 23:10:52,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-16 23:10:52,713 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2024-11-16 23:10:52,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2024-11-16 23:10:52,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:52,716 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2024-11-16 23:10:52,717 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-16 23:10:52,718 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2024-11-16 23:10:52,718 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2024-11-16 23:10:52,719 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-16 23:10:52,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:52,719 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-16 23:10:52,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:10:52,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1527941003, now seen corresponding path program 1 times [2024-11-16 23:10:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940405371] [2024-11-16 23:10:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:52,774 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-16 23:10:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940405371] [2024-11-16 23:10:52,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940405371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:52,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:52,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595000379] [2024-11-16 23:10:52,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:52,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:52,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:52,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 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-16 23:10:52,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:52,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:52,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:52,846 INFO L124 PetriNetUnfolderBase]: 15/283 cut-off events. [2024-11-16 23:10:52,846 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:10:52,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 283 events. 15/283 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1026 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 321. Up to 15 conditions per place. [2024-11-16 23:10:52,850 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2024-11-16 23:10:52,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 366 flow [2024-11-16 23:10:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-16 23:10:52,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-16 23:10:52,852 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 495 transitions. [2024-11-16 23:10:52,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 366 flow [2024-11-16 23:10:52,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:52,855 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 338 flow [2024-11-16 23:10:52,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2024-11-16 23:10:52,857 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -15 predicate places. [2024-11-16 23:10:52,858 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 338 flow [2024-11-16 23:10:52,859 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-16 23:10:52,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:52,859 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-16 23:10:52,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:10:52,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:52,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1796304651, now seen corresponding path program 1 times [2024-11-16 23:10:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358926114] [2024-11-16 23:10:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:52,904 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-16 23:10:52,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358926114] [2024-11-16 23:10:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358926114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:52,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129465957] [2024-11-16 23:10:52,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:52,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:52,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:52,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:52,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:52,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-16 23:10:52,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 338 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-16 23:10:52,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:52,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-16 23:10:52,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,026 INFO L124 PetriNetUnfolderBase]: 63/521 cut-off events. [2024-11-16 23:10:53,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:53,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 521 events. 63/521 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2807 event pairs, 22 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 631. Up to 77 conditions per place. [2024-11-16 23:10:53,033 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2024-11-16 23:10:53,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 374 flow [2024-11-16 23:10:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-16 23:10:53,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-16 23:10:53,035 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 338 flow. Second operand 3 states and 492 transitions. [2024-11-16 23:10:53,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 374 flow [2024-11-16 23:10:53,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:53,038 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2024-11-16 23:10:53,038 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-16 23:10:53,040 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2024-11-16 23:10:53,041 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2024-11-16 23:10:53,041 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-16 23:10:53,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,041 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-16 23:10:53,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:10:53,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1580953316, now seen corresponding path program 1 times [2024-11-16 23:10:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879861349] [2024-11-16 23:10:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,106 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-16 23:10:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879861349] [2024-11-16 23:10:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879861349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455066764] [2024-11-16 23:10:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:53,125 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-16 23:10:53,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:53,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,181 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2024-11-16 23:10:53,181 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:10:53,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 449 events. 37/449 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2210 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 521. Up to 32 conditions per place. [2024-11-16 23:10:53,185 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-11-16 23:10:53,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2024-11-16 23:10:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-16 23:10:53,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-16 23:10:53,188 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2024-11-16 23:10:53,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2024-11-16 23:10:53,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:53,191 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2024-11-16 23:10:53,191 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-16 23:10:53,191 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2024-11-16 23:10:53,192 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2024-11-16 23:10:53,192 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-16 23:10:53,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,192 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-16 23:10:53,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:10:53,193 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1355160754, now seen corresponding path program 1 times [2024-11-16 23:10:53,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8611468] [2024-11-16 23:10:53,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,238 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-16 23:10:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8611468] [2024-11-16 23:10:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8611468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802165410] [2024-11-16 23:10:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:53,268 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-16 23:10:53,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:53,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,306 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2024-11-16 23:10:53,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:53,308 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 732 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-16 23:10:53,310 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-11-16 23:10:53,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2024-11-16 23:10:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-16 23:10:53,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-16 23:10:53,312 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2024-11-16 23:10:53,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2024-11-16 23:10:53,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:53,315 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2024-11-16 23:10:53,315 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-16 23:10:53,318 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2024-11-16 23:10:53,318 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2024-11-16 23:10:53,319 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-16 23:10:53,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,319 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-16 23:10:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:10:53,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -430840164, now seen corresponding path program 1 times [2024-11-16 23:10:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179593534] [2024-11-16 23:10:53,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,375 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-16 23:10:53,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179593534] [2024-11-16 23:10:53,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179593534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:10:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222664789] [2024-11-16 23:10:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-16 23:10:53,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 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-16 23:10:53,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-16 23:10:53,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,459 INFO L124 PetriNetUnfolderBase]: 25/588 cut-off events. [2024-11-16 23:10:53,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:53,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 588 events. 25/588 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2588 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 635. Up to 21 conditions per place. [2024-11-16 23:10:53,466 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-11-16 23:10:53,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 164 transitions, 362 flow [2024-11-16 23:10:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-16 23:10:53,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-16 23:10:53,468 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 506 transitions. [2024-11-16 23:10:53,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 164 transitions, 362 flow [2024-11-16 23:10:53,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 164 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:53,472 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 338 flow [2024-11-16 23:10:53,473 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2024-11-16 23:10:53,473 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2024-11-16 23:10:53,474 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 338 flow [2024-11-16 23:10:53,475 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-16 23:10:53,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,475 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-16 23:10:53,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:10:53,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash -430836706, now seen corresponding path program 1 times [2024-11-16 23:10:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942259254] [2024-11-16 23:10:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,521 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-16 23:10:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942259254] [2024-11-16 23:10:53,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942259254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14168953] [2024-11-16 23:10:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-16 23:10:53,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 338 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-16 23:10:53,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-16 23:10:53,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,643 INFO L124 PetriNetUnfolderBase]: 55/572 cut-off events. [2024-11-16 23:10:53,644 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 23:10:53,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 572 events. 55/572 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2527 event pairs, 10 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 673. Up to 56 conditions per place. [2024-11-16 23:10:53,648 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/162 dead transitions. [2024-11-16 23:10:53,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 162 transitions, 364 flow [2024-11-16 23:10:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-16 23:10:53,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-16 23:10:53,650 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 338 flow. Second operand 3 states and 498 transitions. [2024-11-16 23:10:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 162 transitions, 364 flow [2024-11-16 23:10:53,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 162 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:10:53,652 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 338 flow [2024-11-16 23:10:53,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2024-11-16 23:10:53,653 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2024-11-16 23:10:53,653 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 338 flow [2024-11-16 23:10:53,654 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-16 23:10:53,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,654 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-16 23:10:53,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:10:53,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1717202870, now seen corresponding path program 1 times [2024-11-16 23:10:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250558056] [2024-11-16 23:10:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,685 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-16 23:10:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250558056] [2024-11-16 23:10:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250558056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838965247] [2024-11-16 23:10:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-16 23:10:53,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 338 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-16 23:10:53,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-16 23:10:53,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,766 INFO L124 PetriNetUnfolderBase]: 61/534 cut-off events. [2024-11-16 23:10:53,766 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:53,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 534 events. 61/534 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2318 event pairs, 10 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 663. Up to 72 conditions per place. [2024-11-16 23:10:53,772 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-11-16 23:10:53,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 160 transitions, 364 flow [2024-11-16 23:10:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-16 23:10:53,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-16 23:10:53,775 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 338 flow. Second operand 3 states and 498 transitions. [2024-11-16 23:10:53,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 160 transitions, 364 flow [2024-11-16 23:10:53,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:53,778 INFO L231 Difference]: Finished difference. Result has 163 places, 158 transitions, 332 flow [2024-11-16 23:10:53,778 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=163, PETRI_TRANSITIONS=158} [2024-11-16 23:10:53,779 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-16 23:10:53,779 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 332 flow [2024-11-16 23:10:53,780 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-16 23:10:53,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,780 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-16 23:10:53,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:10:53,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2091374003, now seen corresponding path program 1 times [2024-11-16 23:10:53,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932575558] [2024-11-16 23:10:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,826 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-16 23:10:53,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932575558] [2024-11-16 23:10:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932575558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813800593] [2024-11-16 23:10:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:53,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 332 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-16 23:10:53,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:53,892 INFO L124 PetriNetUnfolderBase]: 15/334 cut-off events. [2024-11-16 23:10:53,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:53,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 334 events. 15/334 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 944 event pairs, 6 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 385. Up to 25 conditions per place. [2024-11-16 23:10:53,896 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-11-16 23:10:53,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 158 transitions, 360 flow [2024-11-16 23:10:53,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-16 23:10:53,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-16 23:10:53,898 INFO L175 Difference]: Start difference. First operand has 163 places, 158 transitions, 332 flow. Second operand 3 states and 495 transitions. [2024-11-16 23:10:53,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 158 transitions, 360 flow [2024-11-16 23:10:53,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 158 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:53,903 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 330 flow [2024-11-16 23:10:53,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=160, 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=330, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2024-11-16 23:10:53,904 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -22 predicate places. [2024-11-16 23:10:53,904 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 330 flow [2024-11-16 23:10:53,905 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-16 23:10:53,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:53,905 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-16 23:10:53,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:10:53,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:53,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 823902383, now seen corresponding path program 1 times [2024-11-16 23:10:53,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:53,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946063892] [2024-11-16 23:10:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:53,937 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-16 23:10:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:53,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946063892] [2024-11-16 23:10:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946063892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:53,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762256632] [2024-11-16 23:10:53,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:53,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:53,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:53,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:53,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:53,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-16 23:10:53,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 330 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-16 23:10:53,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:53,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-16 23:10:53,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:54,028 INFO L124 PetriNetUnfolderBase]: 61/588 cut-off events. [2024-11-16 23:10:54,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:54,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 588 events. 61/588 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2851 event pairs, 34 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 717. Up to 75 conditions per place. [2024-11-16 23:10:54,034 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-11-16 23:10:54,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 362 flow [2024-11-16 23:10:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-16 23:10:54,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-16 23:10:54,036 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 330 flow. Second operand 3 states and 496 transitions. [2024-11-16 23:10:54,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 158 transitions, 362 flow [2024-11-16 23:10:54,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:54,039 INFO L231 Difference]: Finished difference. Result has 161 places, 156 transitions, 328 flow [2024-11-16 23:10:54,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=159, 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=328, PETRI_PLACES=161, PETRI_TRANSITIONS=156} [2024-11-16 23:10:54,040 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-16 23:10:54,041 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 156 transitions, 328 flow [2024-11-16 23:10:54,041 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-16 23:10:54,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:54,041 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-16 23:10:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:10:54,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1453100264, now seen corresponding path program 1 times [2024-11-16 23:10:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258203362] [2024-11-16 23:10:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:54,079 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-16 23:10:54,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:54,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258203362] [2024-11-16 23:10:54,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258203362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:54,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:54,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475846230] [2024-11-16 23:10:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:54,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:54,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-16 23:10:54,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 156 transitions, 328 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-16 23:10:54,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:54,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-16 23:10:54,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:54,188 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2024-11-16 23:10:54,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:54,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 584 events. 65/584 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2915 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 733. Up to 83 conditions per place. [2024-11-16 23:10:54,193 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-16 23:10:54,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 362 flow [2024-11-16 23:10:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-16 23:10:54,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-16 23:10:54,195 INFO L175 Difference]: Start difference. First operand has 161 places, 156 transitions, 328 flow. Second operand 3 states and 494 transitions. [2024-11-16 23:10:54,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 362 flow [2024-11-16 23:10:54,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:54,198 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2024-11-16 23:10:54,198 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-16 23:10:54,198 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-16 23:10:54,199 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2024-11-16 23:10:54,199 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-16 23:10:54,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:54,199 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-16 23:10:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:10:54,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -334354418, now seen corresponding path program 1 times [2024-11-16 23:10:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:54,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588556561] [2024-11-16 23:10:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:54,224 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-16 23:10:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588556561] [2024-11-16 23:10:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588556561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092354298] [2024-11-16 23:10:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:54,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:54,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:54,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-16 23:10:54,236 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-16 23:10:54,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:54,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-16 23:10:54,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:54,298 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2024-11-16 23:10:54,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:54,301 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 2421 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-16 23:10:54,303 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-16 23:10:54,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2024-11-16 23:10:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-16 23:10:54,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2024-11-16 23:10:54,305 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2024-11-16 23:10:54,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2024-11-16 23:10:54,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:54,308 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2024-11-16 23:10:54,308 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-16 23:10:54,309 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-16 23:10:54,309 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2024-11-16 23:10:54,309 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-16 23:10:54,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:54,310 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-16 23:10:54,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:10:54,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:54,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash -938481276, now seen corresponding path program 1 times [2024-11-16 23:10:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877160629] [2024-11-16 23:10:54,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:54,335 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-16 23:10:54,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:54,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877160629] [2024-11-16 23:10:54,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877160629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597131907] [2024-11-16 23:10:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:54,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:54,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:54,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:54,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-16 23:10:54,355 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-16 23:10:54,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:54,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-16 23:10:54,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:54,420 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2024-11-16 23:10:54,420 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-16 23:10:54,424 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 2871 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-16 23:10:54,426 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-11-16 23:10:54,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2024-11-16 23:10:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-16 23:10:54,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-16 23:10:54,428 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2024-11-16 23:10:54,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2024-11-16 23:10:54,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:10:54,431 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2024-11-16 23:10:54,432 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-16 23:10:54,432 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-16 23:10:54,432 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2024-11-16 23:10:54,433 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-16 23:10:54,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:54,433 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-16 23:10:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:10:54,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1745334963, now seen corresponding path program 1 times [2024-11-16 23:10:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113259090] [2024-11-16 23:10:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:54,459 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-16 23:10:54,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:54,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113259090] [2024-11-16 23:10:54,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113259090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:54,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:10:54,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:10:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566381835] [2024-11-16 23:10:54,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:54,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:54,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:54,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:10:54,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-16 23:10:54,485 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-16 23:10:54,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:54,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-16 23:10:54,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:54,551 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2024-11-16 23:10:54,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:54,555 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 2544 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-16 23:10:54,556 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-11-16 23:10:54,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2024-11-16 23:10:54,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-16 23:10:54,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-16 23:10:54,558 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2024-11-16 23:10:54,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2024-11-16 23:10:54,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:54,562 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2024-11-16 23:10:54,562 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-16 23:10:54,562 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-16 23:10:54,563 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2024-11-16 23:10:54,563 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-16 23:10:54,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:54,563 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-16 23:10:54,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:10:54,563 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:54,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1395351477, now seen corresponding path program 1 times [2024-11-16 23:10:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175624620] [2024-11-16 23:10:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:54,670 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-16 23:10:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175624620] [2024-11-16 23:10:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175624620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:10:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816406291] [2024-11-16 23:10:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:54,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:10:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:10:54,673 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-16 23:10:54,674 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-16 23:10:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:54,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:10:54,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:10:54,792 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-16 23:10:54,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:10:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816406291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:54,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:10:54,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-16 23:10:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160232108] [2024-11-16 23:10:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:10:54,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-16 23:10:54,798 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-16 23:10:54,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:54,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-16 23:10:54,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:54,861 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2024-11-16 23:10:54,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:10:54,865 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 1812 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-16 23:10:54,867 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-16 23:10:54,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2024-11-16 23:10:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-16 23:10:54,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2024-11-16 23:10:54,869 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2024-11-16 23:10:54,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2024-11-16 23:10:54,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:54,873 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2024-11-16 23:10:54,874 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-16 23:10:54,874 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-16 23:10:54,874 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2024-11-16 23:10:54,874 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-16 23:10:54,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:54,875 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-16 23:10:54,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 23:10:55,079 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-16 23:10:55,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:55,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash -166228785, now seen corresponding path program 1 times [2024-11-16 23:10:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:55,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407509623] [2024-11-16 23:10:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:55,172 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-16 23:10:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407509623] [2024-11-16 23:10:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407509623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:10:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913321824] [2024-11-16 23:10:55,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:55,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:10:55,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:10:55,175 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-16 23:10:55,177 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-16 23:10:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:55,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:10:55,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:10:55,292 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-16 23:10:55,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:10:55,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913321824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:10:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 23:10:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-16 23:10:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696385739] [2024-11-16 23:10:55,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:10:55,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:10:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:55,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:10:55,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:10:55,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-16 23:10:55,297 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-16 23:10:55,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:55,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-16 23:10:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:55,373 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2024-11-16 23:10:55,373 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2024-11-16 23:10:55,378 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 2729 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-16 23:10:55,381 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-16 23:10:55,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2024-11-16 23:10:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:10:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:10:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-11-16 23:10:55,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2024-11-16 23:10:55,383 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2024-11-16 23:10:55,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2024-11-16 23:10:55,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:55,387 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2024-11-16 23:10:55,387 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-16 23:10:55,387 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-16 23:10:55,388 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2024-11-16 23:10:55,388 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-16 23:10:55,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:55,388 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-16 23:10:55,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 23:10:55,589 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-16 23:10:55,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:55,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1791540236, now seen corresponding path program 1 times [2024-11-16 23:10:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:55,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473840086] [2024-11-16 23:10:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:55,695 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-16 23:10:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473840086] [2024-11-16 23:10:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473840086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:10:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738533500] [2024-11-16 23:10:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:55,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:10:55,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:10:55,699 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-16 23:10:55,700 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-16 23:10:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:55,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:10:55,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:10:55,918 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-16 23:10:55,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:10:56,011 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-16 23:10:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738533500] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:10:56,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:10:56,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-16 23:10:56,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089293251] [2024-11-16 23:10:56,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:10:56,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 23:10:56,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 23:10:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 23:10:56,033 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-16 23:10:56,036 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-16 23:10:56,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:56,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-16 23:10:56,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:56,295 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2024-11-16 23:10:56,295 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2024-11-16 23:10:56,305 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 6524 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-16 23:10:56,316 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2024-11-16 23:10:56,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2024-11-16 23:10:56,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:10:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:10:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2024-11-16 23:10:56,320 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2024-11-16 23:10:56,320 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2024-11-16 23:10:56,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2024-11-16 23:10:56,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:10:56,327 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2024-11-16 23:10:56,327 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-16 23:10:56,328 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-16 23:10:56,328 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2024-11-16 23:10:56,329 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-16 23:10:56,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:56,329 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-16 23:10:56,343 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-16 23:10:56,530 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-16 23:10:56,530 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:56,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:56,531 INFO L85 PathProgramCache]: Analyzing trace with hash -480125876, now seen corresponding path program 2 times [2024-11-16 23:10:56,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:56,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948693522] [2024-11-16 23:10:56,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:56,726 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-16 23:10:56,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948693522] [2024-11-16 23:10:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948693522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:10:56,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858589632] [2024-11-16 23:10:56,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:10:56,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:10:56,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:10:56,729 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-16 23:10:56,731 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-16 23:10:56,820 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:10:56,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:10:56,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 23:10:56,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:10:57,005 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-16 23:10:57,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:10:57,215 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-16 23:10:57,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858589632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:10:57,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:10:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-16 23:10:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239457737] [2024-11-16 23:10:57,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:10:57,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 23:10:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:57,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 23:10:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-16 23:10:57,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-16 23:10:57,245 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-16 23:10:57,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:57,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-16 23:10:57,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:10:57,830 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2024-11-16 23:10:57,830 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2024-11-16 23:10:57,841 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 10431 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-16 23:10:57,851 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2024-11-16 23:10:57,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2024-11-16 23:10:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 23:10:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-16 23:10:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2024-11-16 23:10:57,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2024-11-16 23:10:57,858 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2024-11-16 23:10:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2024-11-16 23:10:57,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-16 23:10:57,865 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2024-11-16 23:10:57,865 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-16 23:10:57,865 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2024-11-16 23:10:57,866 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2024-11-16 23:10:57,867 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-16 23:10:57,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:10:57,867 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-16 23:10:57,885 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-16 23:10:58,067 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-16 23:10:58,068 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:10:58,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:10:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1628009268, now seen corresponding path program 3 times [2024-11-16 23:10:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:10:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254940923] [2024-11-16 23:10:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:10:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:10:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:10:58,626 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-16 23:10:58,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:10:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254940923] [2024-11-16 23:10:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254940923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:10:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762387337] [2024-11-16 23:10:58,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 23:10:58,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:10:58,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:10:58,629 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-16 23:10:58,631 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-16 23:10:58,774 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-16 23:10:58,774 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:10:58,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 23:10:58,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:10:59,132 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-16 23:10:59,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:10:59,671 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-16 23:10:59,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762387337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:10:59,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:10:59,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-16 23:10:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960882229] [2024-11-16 23:10:59,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:10:59,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-16 23:10:59,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:10:59,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-16 23:10:59,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 23:10:59,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-16 23:10:59,706 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-16 23:10:59,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:10:59,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-16 23:10:59,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:01,364 INFO L124 PetriNetUnfolderBase]: 722/3890 cut-off events. [2024-11-16 23:11:01,365 INFO L125 PetriNetUnfolderBase]: For 4577/4609 co-relation queries the response was YES. [2024-11-16 23:11:01,384 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 18356 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-16 23:11:01,405 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 291 selfloop transitions, 45 changer transitions 0/477 dead transitions. [2024-11-16 23:11:01,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 477 transitions, 3078 flow [2024-11-16 23:11:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-16 23:11:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-16 23:11:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7321 transitions. [2024-11-16 23:11:01,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8653664302600473 [2024-11-16 23:11:01,421 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 45 states and 7321 transitions. [2024-11-16 23:11:01,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 477 transitions, 3078 flow [2024-11-16 23:11:01,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 477 transitions, 3038 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-16 23:11:01,437 INFO L231 Difference]: Finished difference. Result has 243 places, 207 transitions, 848 flow [2024-11-16 23:11:01,438 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-16 23:11:01,438 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 59 predicate places. [2024-11-16 23:11:01,439 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 207 transitions, 848 flow [2024-11-16 23:11:01,441 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-16 23:11:01,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:01,442 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-16 23:11:01,459 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-16 23:11:01,645 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-16 23:11:01,646 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:11:01,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1620024352, now seen corresponding path program 4 times [2024-11-16 23:11:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25391397] [2024-11-16 23:11:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:11:03,373 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-16 23:11:03,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:11:03,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25391397] [2024-11-16 23:11:03,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25391397] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 23:11:03,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113055842] [2024-11-16 23:11:03,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-16 23:11:03,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 23:11:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:11:03,376 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-16 23:11:03,378 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-16 23:11:03,554 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-16 23:11:03,554 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:11:03,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-16 23:11:03,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:11:04,245 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-16 23:11:04,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:11:05,442 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-16 23:11:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113055842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:11:05,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 23:11:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2024-11-16 23:11:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720854412] [2024-11-16 23:11:05,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 23:11:05,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-16 23:11:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:11:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-16 23:11:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2024-11-16 23:11:05,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-16 23:11:05,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 848 flow. Second operand has 51 states, 51 states have (on average 161.11764705882354) internal successors, (8217), 51 states have internal predecessors, (8217), 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-16 23:11:05,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:11:05,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-16 23:11:05,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:11:08,724 INFO L124 PetriNetUnfolderBase]: 1082/5825 cut-off events. [2024-11-16 23:11:08,724 INFO L125 PetriNetUnfolderBase]: For 12456/12488 co-relation queries the response was YES. [2024-11-16 23:11:08,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 5825 events. 1082/5825 cut-off events. For 12456/12488 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 27346 event pairs, 13 based on Foata normal form. 51/5815 useless extension candidates. Maximal degree in co-relation 11768. Up to 558 conditions per place. [2024-11-16 23:11:08,775 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 462 selfloop transitions, 72 changer transitions 0/675 dead transitions. [2024-11-16 23:11:08,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 675 transitions, 4930 flow [2024-11-16 23:11:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-11-16 23:11:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2024-11-16 23:11:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 11705 transitions. [2024-11-16 23:11:08,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8647310874704491 [2024-11-16 23:11:08,785 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 848 flow. Second operand 72 states and 11705 transitions. [2024-11-16 23:11:08,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 675 transitions, 4930 flow [2024-11-16 23:11:08,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 675 transitions, 4856 flow, removed 19 selfloop flow, removed 18 redundant places. [2024-11-16 23:11:08,808 INFO L231 Difference]: Finished difference. Result has 306 places, 235 transitions, 1230 flow [2024-11-16 23:11:08,809 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=72, PETRI_FLOW=1230, PETRI_PLACES=306, PETRI_TRANSITIONS=235} [2024-11-16 23:11:08,809 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 122 predicate places. [2024-11-16 23:11:08,809 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 235 transitions, 1230 flow [2024-11-16 23:11:08,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 161.11764705882354) internal successors, (8217), 51 states have internal predecessors, (8217), 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-16 23:11:08,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:11:08,813 INFO L204 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:11:08,832 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-16 23:11:09,017 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-16 23:11:09,018 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-16 23:11:09,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:11:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1922216482, now seen corresponding path program 5 times [2024-11-16 23:11:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:11:09,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030038117] [2024-11-16 23:11:09,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:11:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:11:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:11:09,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 23:11:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 23:11:09,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 23:11:09,445 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 23:11:09,446 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-16 23:11:09,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-16 23:11:09,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-16 23:11:09,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-16 23:11:09,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-16 23:11:09,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-16 23:11:09,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-16 23:11:09,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-16 23:11:09,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-16 23:11:09,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2024-11-16 23:11:09,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-16 23:11:09,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-16 23:11:09,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-16 23:11:09,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-16 23:11:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:11:09,454 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-16 23:11:09,900 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:11:09,901 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:11:09,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:11:09 BasicIcfg [2024-11-16 23:11:09,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:11:09,908 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:11:09,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:11:09,909 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:11:09,909 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:10:51" (3/4) ... [2024-11-16 23:11:09,910 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 23:11:10,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:11:10,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:11:10,311 INFO L158 Benchmark]: Toolchain (without parser) took 20205.57ms. Allocated memory was 184.5MB in the beginning and 817.9MB in the end (delta: 633.3MB). Free memory was 125.4MB in the beginning and 406.8MB in the end (delta: -281.4MB). Peak memory consumption was 355.7MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,311 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 184.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:11:10,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.17ms. Allocated memory is still 184.5MB. Free memory was 125.0MB in the beginning and 102.7MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.23ms. Allocated memory is still 184.5MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,312 INFO L158 Benchmark]: Boogie Preprocessor took 24.61ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 99.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,312 INFO L158 Benchmark]: IcfgBuilder took 587.04ms. Allocated memory is still 184.5MB. Free memory was 99.0MB in the beginning and 75.1MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,312 INFO L158 Benchmark]: TraceAbstraction took 18623.67ms. Allocated memory was 184.5MB in the beginning and 817.9MB in the end (delta: 633.3MB). Free memory was 74.3MB in the beginning and 566.2MB in the end (delta: -492.0MB). Peak memory consumption was 334.7MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,312 INFO L158 Benchmark]: Witness Printer took 402.15ms. Allocated memory is still 817.9MB. Free memory was 566.2MB in the beginning and 406.8MB in the end (delta: 159.4MB). Peak memory consumption was 159.4MB. Max. memory is 16.1GB. [2024-11-16 23:11:10,315 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.22ms. Allocated memory is still 184.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.17ms. Allocated memory is still 184.5MB. Free memory was 125.0MB in the beginning and 102.7MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.23ms. Allocated memory is still 184.5MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.61ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 99.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 587.04ms. Allocated memory is still 184.5MB. Free memory was 99.0MB in the beginning and 75.1MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18623.67ms. Allocated memory was 184.5MB in the beginning and 817.9MB in the end (delta: 633.3MB). Free memory was 74.3MB in the beginning and 566.2MB in the end (delta: -492.0MB). Peak memory consumption was 334.7MB. Max. memory is 16.1GB. * Witness Printer took 402.15ms. Allocated memory is still 817.9MB. Free memory was 566.2MB in the beginning and 406.8MB in the end (delta: 159.4MB). Peak memory consumption was 159.4MB. 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)=75108, \old(argv)={75058:75083}, argc=75108, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=75108, \old(argv)={75058:75083}, argc=75108, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=75108, \old(argv)={75058:75083}, argc=75108, 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)=75108, \old(argv)={75058:75083}, argc=75108, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] 1 p = 0 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] 1 p < 11 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] COND TRUE 1 p < 11 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=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)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, 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}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND FALSE 0 !(x < 24) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=46368, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, correct=46368, cur=75025, i=1, id1=-1, id2=0, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, correct=46368, cur=75025, i=1, id1=-1, id2=0, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=2, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, correct=46368, cur=75025, i=2, id1=-1, id2=0, j=1, next=75025, p=0, prev=46368, q=0, x=24] 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: 18.0s, OverallIterations: 24, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1486 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1283 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1182 IncrementalHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 77 mSDtfsCounter, 1182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2712 GetRequests, 2478 SyntacticMatches, 15 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1230occurred in iteration=23, InterpolantAutomatonStates: 203, 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.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 4421 NumberOfCodeBlocks, 4421 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4653 ConstructedInterpolants, 0 QuantifiedInterpolants, 10497 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-16 23:11:10,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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