./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-12-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/fib_safe-12-racy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d91b46fd69b3013c60bad92e46ce1ef1ddf2b09c97cd6d95697162ae1af201f2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:27:34,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:27:34,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:27:34,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:27:34,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:27:35,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:27:35,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:27:35,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:27:35,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:27:35,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:27:35,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:27:35,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:27:35,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:27:35,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:27:35,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:27:35,018 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:27:35,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:27:35,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:27:35,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:27:35,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:27:35,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:27:35,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:27:35,020 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:27:35,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:27:35,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:27:35,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:27:35,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:27:35,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:27:35,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:27:35,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:27:35,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:27:35,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:27:35,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:27:35,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:27:35,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:27:35,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:27:35,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:27:35,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:27:35,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:27:35,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:27:35,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:27:35,027 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d91b46fd69b3013c60bad92e46ce1ef1ddf2b09c97cd6d95697162ae1af201f2 [2024-11-09 06:27:35,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:27:35,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:27:35,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:27:35,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:27:35,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:27:35,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-12-racy.i [2024-11-09 06:27:37,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:27:37,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:27:37,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-12-racy.i [2024-11-09 06:27:37,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c61b502b/9e5accf83d25419eb789afebfee47d09/FLAG4b6582c3e [2024-11-09 06:27:37,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c61b502b/9e5accf83d25419eb789afebfee47d09 [2024-11-09 06:27:37,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:27:37,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:27:37,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:27:37,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:27:37,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:27:37,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365f4814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37, skipping insertion in model container [2024-11-09 06:27:37,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:27:37,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:27:37,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:27:37,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:27:37,876 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:27:37,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37 WrapperNode [2024-11-09 06:27:37,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:27:37,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:27:37,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:27:37,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:27:37,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,926 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-11-09 06:27:37,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:27:37,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:27:37,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:27:37,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:27:37,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:27:37,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:27:37,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:27:37,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:27:37,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (1/1) ... [2024-11-09 06:27:37,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:27:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:38,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:27:38,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:27:38,065 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 06:27:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 06:27:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 06:27:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 06:27:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 06:27:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:27:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:27:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 06:27:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:27:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:27:38,105 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:27:38,325 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:27:38,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:27:38,705 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:27:38,705 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:27:38,817 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:27:38,818 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 06:27:38,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:27:38 BoogieIcfgContainer [2024-11-09 06:27:38,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:27:38,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:27:38,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:27:38,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:27:38,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:27:37" (1/3) ... [2024-11-09 06:27:38,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21462d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:27:38, skipping insertion in model container [2024-11-09 06:27:38,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:27:37" (2/3) ... [2024-11-09 06:27:38,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21462d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:27:38, skipping insertion in model container [2024-11-09 06:27:38,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:27:38" (3/3) ... [2024-11-09 06:27:38,831 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-12-racy.i [2024-11-09 06:27:38,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:27:38,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-09 06:27:38,851 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:27:38,916 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 06:27:38,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2024-11-09 06:27:39,019 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2024-11-09 06:27:39,020 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:39,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 186 events. 9/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 382 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2024-11-09 06:27:39,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2024-11-09 06:27:39,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2024-11-09 06:27:39,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:27:39,065 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;@6e3cbf0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:27:39,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 06:27:39,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:27:39,078 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-09 06:27:39,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:39,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:39,079 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-09 06:27:39,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:39,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash 959234546, now seen corresponding path program 1 times [2024-11-09 06:27:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166725450] [2024-11-09 06:27:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:39,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:39,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166725450] [2024-11-09 06:27:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166725450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:27:39,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256256123] [2024-11-09 06:27:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 06:27:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 06:27:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 06:27:39,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2024-11-09 06:27:39,409 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-09 06:27:39,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:39,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2024-11-09 06:27:39,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:39,575 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2024-11-09 06:27:39,576 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:27:39,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 286 events. 9/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 931 event pairs, 2 based on Foata normal form. 12/248 useless extension candidates. Maximal degree in co-relation 270. Up to 11 conditions per place. [2024-11-09 06:27:39,588 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2024-11-09 06:27:39,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2024-11-09 06:27:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 06:27:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 06:27:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2024-11-09 06:27:39,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2024-11-09 06:27:39,608 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2024-11-09 06:27:39,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2024-11-09 06:27:39,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:39,625 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2024-11-09 06:27:39,631 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-09 06:27:39,634 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2024-11-09 06:27:39,634 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2024-11-09 06:27:39,635 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-09 06:27:39,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:39,638 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-09 06:27:39,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:27:39,639 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:39,643 INFO L85 PathProgramCache]: Analyzing trace with hash -529477545, now seen corresponding path program 1 times [2024-11-09 06:27:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174438791] [2024-11-09 06:27:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174438791] [2024-11-09 06:27:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174438791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623609705] [2024-11-09 06:27:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:39,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:39,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:39,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:39,894 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-09 06:27:39,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:39,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:39,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:40,096 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2024-11-09 06:27:40,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:40,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 366 events. 30/366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1651 event pairs, 8 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 436. Up to 41 conditions per place. [2024-11-09 06:27:40,118 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-09 06:27:40,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2024-11-09 06:27:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-09 06:27:40,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-09 06:27:40,130 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2024-11-09 06:27:40,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2024-11-09 06:27:40,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:27:40,148 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2024-11-09 06:27:40,148 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-09 06:27:40,150 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2024-11-09 06:27:40,150 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2024-11-09 06:27:40,151 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-09 06:27:40,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:40,151 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-09 06:27:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:27:40,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:40,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844589, now seen corresponding path program 1 times [2024-11-09 06:27:40,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:40,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111136877] [2024-11-09 06:27:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:40,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111136877] [2024-11-09 06:27:40,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111136877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:40,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75165924] [2024-11-09 06:27:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:40,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:40,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:40,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:40,381 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-09 06:27:40,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:40,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:40,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:40,508 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2024-11-09 06:27:40,515 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:27:40,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 222 events. 20/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 806 event pairs, 4 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2024-11-09 06:27:40,523 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-09 06:27:40,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2024-11-09 06:27:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-09 06:27:40,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-09 06:27:40,526 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2024-11-09 06:27:40,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2024-11-09 06:27:40,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:40,605 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2024-11-09 06:27:40,608 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-09 06:27:40,609 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-09 06:27:40,609 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2024-11-09 06:27:40,609 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-09 06:27:40,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:40,610 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-09 06:27:40,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:27:40,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:40,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -934832415, now seen corresponding path program 1 times [2024-11-09 06:27:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525860196] [2024-11-09 06:27:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:40,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:40,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525860196] [2024-11-09 06:27:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525860196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:40,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:40,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:40,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283170624] [2024-11-09 06:27:40,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:40,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:40,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:40,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:40,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:40,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:40,769 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-09 06:27:40,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:40,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:40,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:40,890 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2024-11-09 06:27:40,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:40,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1079 event pairs, 7 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 327. Up to 26 conditions per place. [2024-11-09 06:27:40,899 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-09 06:27:40,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2024-11-09 06:27:40,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-09 06:27:40,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-09 06:27:40,901 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2024-11-09 06:27:40,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2024-11-09 06:27:40,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:40,907 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2024-11-09 06:27:40,908 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-09 06:27:40,908 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2024-11-09 06:27:40,909 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2024-11-09 06:27:40,913 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-09 06:27:40,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:40,914 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-09 06:27:40,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:27:40,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1890395950, now seen corresponding path program 1 times [2024-11-09 06:27:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864246652] [2024-11-09 06:27:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:40,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864246652] [2024-11-09 06:27:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864246652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:40,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351295621] [2024-11-09 06:27:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:40,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-09 06:27:40,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:40,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:40,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-09 06:27:40,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:41,077 INFO L124 PetriNetUnfolderBase]: 49/479 cut-off events. [2024-11-09 06:27:41,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 479 events. 49/479 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2570 event pairs, 30 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 571. Up to 67 conditions per place. [2024-11-09 06:27:41,086 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-11-09 06:27:41,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 378 flow [2024-11-09 06:27:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-09 06:27:41,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-09 06:27:41,091 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 492 transitions. [2024-11-09 06:27:41,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 378 flow [2024-11-09 06:27:41,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:41,095 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 340 flow [2024-11-09 06:27:41,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2024-11-09 06:27:41,097 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -14 predicate places. [2024-11-09 06:27:41,097 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 340 flow [2024-11-09 06:27:41,098 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-09 06:27:41,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:41,098 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-09 06:27:41,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:27:41,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:41,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1023988735, now seen corresponding path program 1 times [2024-11-09 06:27:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:41,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046798999] [2024-11-09 06:27:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:41,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:41,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046798999] [2024-11-09 06:27:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046798999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627154098] [2024-11-09 06:27:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:41,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:41,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:41,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:41,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:41,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:41,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:41,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:41,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:41,232 INFO L124 PetriNetUnfolderBase]: 15/281 cut-off events. [2024-11-09 06:27:41,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 281 events. 15/281 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1018 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 319. Up to 15 conditions per place. [2024-11-09 06:27:41,237 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2024-11-09 06:27:41,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 364 flow [2024-11-09 06:27:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-09 06:27:41,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-09 06:27:41,240 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 340 flow. Second operand 3 states and 495 transitions. [2024-11-09 06:27:41,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 364 flow [2024-11-09 06:27:41,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 165 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:41,244 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2024-11-09 06:27:41,244 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-09 06:27:41,245 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2024-11-09 06:27:41,247 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2024-11-09 06:27:41,247 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-09 06:27:41,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:41,248 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-09 06:27:41,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:27:41,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1174888269, now seen corresponding path program 1 times [2024-11-09 06:27:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892570151] [2024-11-09 06:27:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:41,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892570151] [2024-11-09 06:27:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892570151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:41,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771890865] [2024-11-09 06:27:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:41,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:41,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:41,323 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-09 06:27:41,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:41,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:41,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:41,394 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2024-11-09 06:27:41,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:41,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 449 events. 37/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2214 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 517. Up to 32 conditions per place. [2024-11-09 06:27:41,400 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-11-09 06:27:41,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2024-11-09 06:27:41,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-09 06:27:41,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-09 06:27:41,402 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2024-11-09 06:27:41,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2024-11-09 06:27:41,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:41,406 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2024-11-09 06:27:41,406 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-09 06:27:41,407 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2024-11-09 06:27:41,407 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2024-11-09 06:27:41,408 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-09 06:27:41,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:41,409 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-09 06:27:41,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:27:41,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1742870495, now seen corresponding path program 1 times [2024-11-09 06:27:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:41,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147884982] [2024-11-09 06:27:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147884982] [2024-11-09 06:27:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147884982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:41,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:41,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704988330] [2024-11-09 06:27:41,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:41,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:41,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:41,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:41,546 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-09 06:27:41,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:41,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:41,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:41,597 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2024-11-09 06:27:41,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:41,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 20/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 753 event pairs, 10 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place. [2024-11-09 06:27:41,600 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-11-09 06:27:41,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2024-11-09 06:27:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-09 06:27:41,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-09 06:27:41,603 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2024-11-09 06:27:41,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2024-11-09 06:27:41,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:41,607 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2024-11-09 06:27:41,607 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-09 06:27:41,610 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2024-11-09 06:27:41,611 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2024-11-09 06:27:41,611 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-09 06:27:41,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:41,612 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-09 06:27:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:27:41,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1408283567, now seen corresponding path program 1 times [2024-11-09 06:27:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401628039] [2024-11-09 06:27:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:41,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:41,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401628039] [2024-11-09 06:27:41,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401628039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:41,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:41,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188922415] [2024-11-09 06:27:41,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:41,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:41,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:41,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:41,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:41,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-09 06:27:41,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:41,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:41,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-09 06:27:41,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:41,762 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events. [2024-11-09 06:27:41,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:41,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 412 events. 33/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1868 event pairs, 6 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 472. Up to 32 conditions per place. [2024-11-09 06:27:41,768 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2024-11-09 06:27:41,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2024-11-09 06:27:41,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-09 06:27:41,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-09 06:27:41,770 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions. [2024-11-09 06:27:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2024-11-09 06:27:41,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:41,773 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow [2024-11-09 06:27:41,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2024-11-09 06:27:41,775 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-09 06:27:41,776 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow [2024-11-09 06:27:41,776 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-09 06:27:41,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:41,777 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-09 06:27:41,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:27:41,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:41,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash 445824893, now seen corresponding path program 1 times [2024-11-09 06:27:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:41,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787132375] [2024-11-09 06:27:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787132375] [2024-11-09 06:27:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787132375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401528523] [2024-11-09 06:27:41,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:41,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:41,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:41,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2024-11-09 06:27:41,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:41,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:41,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2024-11-09 06:27:41,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:41,891 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events. [2024-11-09 06:27:41,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:41,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 360 events. 31/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1470 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 426. Up to 32 conditions per place. [2024-11-09 06:27:41,896 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2024-11-09 06:27:41,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow [2024-11-09 06:27:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2024-11-09 06:27:41,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2024-11-09 06:27:41,898 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions. [2024-11-09 06:27:41,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow [2024-11-09 06:27:41,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:41,902 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow [2024-11-09 06:27:41,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2024-11-09 06:27:41,903 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-09 06:27:41,903 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow [2024-11-09 06:27:41,904 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-09 06:27:41,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:41,904 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-09 06:27:41,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:27:41,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1193293355, now seen corresponding path program 1 times [2024-11-09 06:27:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460148891] [2024-11-09 06:27:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:41,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-09 06:27:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:41,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460148891] [2024-11-09 06:27:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460148891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:41,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114479413] [2024-11-09 06:27:41,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:41,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:41,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:41,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:41,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:41,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,008 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2024-11-09 06:27:42,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:42,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 266 events. 15/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 920 event pairs, 6 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 306. Up to 25 conditions per place. [2024-11-09 06:27:42,011 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-09 06:27:42,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow [2024-11-09 06:27:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2024-11-09 06:27:42,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2024-11-09 06:27:42,015 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions. [2024-11-09 06:27:42,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow [2024-11-09 06:27:42,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:42,019 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow [2024-11-09 06:27:42,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-09 06:27:42,019 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-09 06:27:42,021 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow [2024-11-09 06:27:42,022 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-09 06:27:42,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:42,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:27:42,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 215393162, now seen corresponding path program 1 times [2024-11-09 06:27:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765357360] [2024-11-09 06:27:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:42,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765357360] [2024-11-09 06:27:42,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765357360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:42,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75559269] [2024-11-09 06:27:42,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:42,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:42,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:42,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2024-11-09 06:27:42,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:42,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:42,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2024-11-09 06:27:42,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,157 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2024-11-09 06:27:42,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:42,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 436 events. 41/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2170 event pairs, 22 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 512. Up to 51 conditions per place. [2024-11-09 06:27:42,163 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-09 06:27:42,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow [2024-11-09 06:27:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2024-11-09 06:27:42,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2024-11-09 06:27:42,166 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions. [2024-11-09 06:27:42,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow [2024-11-09 06:27:42,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:42,170 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow [2024-11-09 06:27:42,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2024-11-09 06:27:42,172 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-09 06:27:42,172 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow [2024-11-09 06:27:42,173 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-09 06:27:42,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:42,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:27:42,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1089341189, now seen corresponding path program 1 times [2024-11-09 06:27:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227990694] [2024-11-09 06:27:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:42,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:42,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227990694] [2024-11-09 06:27:42,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227990694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:42,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:42,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:27:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628635037] [2024-11-09 06:27:42,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:42,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:42,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:42,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:42,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:42,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-09 06:27:42,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:42,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:42,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-09 06:27:42,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,348 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2024-11-09 06:27:42,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:42,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 550 events. 25/550 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2286 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 611. Up to 21 conditions per place. [2024-11-09 06:27:42,354 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-11-09 06:27:42,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow [2024-11-09 06:27:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-09 06:27:42,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2024-11-09 06:27:42,357 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions. [2024-11-09 06:27:42,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow [2024-11-09 06:27:42,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:42,377 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow [2024-11-09 06:27:42,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2024-11-09 06:27:42,378 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-09 06:27:42,379 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow [2024-11-09 06:27:42,379 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-09 06:27:42,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,379 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:42,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:27:42,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,380 INFO L85 PathProgramCache]: Analyzing trace with hash -800692820, now seen corresponding path program 1 times [2024-11-09 06:27:42,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667882086] [2024-11-09 06:27:42,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667882086] [2024-11-09 06:27:42,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667882086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042119300] [2024-11-09 06:27:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:42,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:42,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-09 06:27:42,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:42,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:42,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-09 06:27:42,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,512 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2024-11-09 06:27:42,513 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:27:42,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 584 events. 65/584 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2923 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place. [2024-11-09 06:27:42,519 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-09 06:27:42,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow [2024-11-09 06:27:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-09 06:27:42,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-09 06:27:42,521 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions. [2024-11-09 06:27:42,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow [2024-11-09 06:27:42,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:27:42,524 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2024-11-09 06:27:42,524 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-09 06:27:42,525 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-09 06:27:42,525 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2024-11-09 06:27:42,525 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-09 06:27:42,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,526 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-09 06:27:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:27:42,526 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash 809008106, now seen corresponding path program 1 times [2024-11-09 06:27:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787493551] [2024-11-09 06:27:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787493551] [2024-11-09 06:27:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787493551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:42,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:42,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:42,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853478234] [2024-11-09 06:27:42,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:42,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:42,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2024-11-09 06:27:42,571 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-09 06:27:42,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:42,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2024-11-09 06:27:42,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,640 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2024-11-09 06:27:42,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:42,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 554 events. 49/554 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2407 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 651. Up to 40 conditions per place. [2024-11-09 06:27:42,647 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2024-11-09 06:27:42,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2024-11-09 06:27:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-09 06:27:42,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2024-11-09 06:27:42,649 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2024-11-09 06:27:42,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2024-11-09 06:27:42,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:42,652 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2024-11-09 06:27:42,652 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-09 06:27:42,653 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-09 06:27:42,653 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2024-11-09 06:27:42,653 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-09 06:27:42,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,653 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:42,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:27:42,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 654170415, now seen corresponding path program 1 times [2024-11-09 06:27:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913278170] [2024-11-09 06:27:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913278170] [2024-11-09 06:27:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913278170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:42,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:42,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889623709] [2024-11-09 06:27:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:42,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:42,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-09 06:27:42,718 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-09 06:27:42,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:42,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-09 06:27:42,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,794 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2024-11-09 06:27:42,795 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 06:27:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 572 events. 69/572 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2880 event pairs, 42 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 733. Up to 91 conditions per place. [2024-11-09 06:27:42,801 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2024-11-09 06:27:42,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2024-11-09 06:27:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2024-11-09 06:27:42,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2024-11-09 06:27:42,803 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2024-11-09 06:27:42,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2024-11-09 06:27:42,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:27:42,806 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2024-11-09 06:27:42,807 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-09 06:27:42,807 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2024-11-09 06:27:42,807 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2024-11-09 06:27:42,808 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-09 06:27:42,808 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,808 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-09 06:27:42,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:27:42,808 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,808 INFO L85 PathProgramCache]: Analyzing trace with hash 308719358, now seen corresponding path program 1 times [2024-11-09 06:27:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266660860] [2024-11-09 06:27:42,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:27:42,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:42,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266660860] [2024-11-09 06:27:42,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266660860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:42,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:27:42,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:27:42,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108255369] [2024-11-09 06:27:42,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:42,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:42,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:42,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:42,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:27:42,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2024-11-09 06:27:42,860 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-09 06:27:42,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:42,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2024-11-09 06:27:42,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:42,930 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2024-11-09 06:27:42,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:42,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 556 events. 57/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2543 event pairs, 38 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 705. Up to 83 conditions per place. [2024-11-09 06:27:42,936 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-11-09 06:27:42,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2024-11-09 06:27:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2024-11-09 06:27:42,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2024-11-09 06:27:42,938 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2024-11-09 06:27:42,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2024-11-09 06:27:42,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:42,941 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2024-11-09 06:27:42,941 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-09 06:27:42,942 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2024-11-09 06:27:42,942 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2024-11-09 06:27:42,943 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-09 06:27:42,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:42,943 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-09 06:27:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:27:42,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:42,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2042320711, now seen corresponding path program 1 times [2024-11-09 06:27:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:42,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682607297] [2024-11-09 06:27:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:43,061 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-09 06:27:43,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:43,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682607297] [2024-11-09 06:27:43,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682607297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:43,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013470424] [2024-11-09 06:27:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:43,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:43,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:43,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:27:43,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:27:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:43,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:27:43,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:43,195 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-09 06:27:43,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:27:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013470424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:43,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:27:43,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 06:27:43,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740146240] [2024-11-09 06:27:43,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:43,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:27:43,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-09 06:27:43,201 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-09 06:27:43,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:43,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-09 06:27:43,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:43,287 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2024-11-09 06:27:43,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:27:43,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 36/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1794 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 563. Up to 31 conditions per place. [2024-11-09 06:27:43,292 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-09 06:27:43,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2024-11-09 06:27:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-09 06:27:43,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2024-11-09 06:27:43,294 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2024-11-09 06:27:43,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2024-11-09 06:27:43,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:43,298 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2024-11-09 06:27:43,298 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-09 06:27:43,299 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2024-11-09 06:27:43,299 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2024-11-09 06:27:43,299 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-09 06:27:43,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:43,300 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-09 06:27:43,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:27:43,504 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-09 06:27:43,506 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:43,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash -222269459, now seen corresponding path program 1 times [2024-11-09 06:27:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956718508] [2024-11-09 06:27:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:43,602 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-09 06:27:43,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:43,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956718508] [2024-11-09 06:27:43,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956718508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:43,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990758818] [2024-11-09 06:27:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:43,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:43,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:43,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:27:43,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:27:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:43,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:27:43,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:43,710 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-09 06:27:43,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:27:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990758818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:27:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:27:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-09 06:27:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135793784] [2024-11-09 06:27:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:27:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:27:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:27:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:27:43,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2024-11-09 06:27:43,717 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-09 06:27:43,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:43,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2024-11-09 06:27:43,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:43,798 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2024-11-09 06:27:43,798 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2024-11-09 06:27:43,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 601 events. 78/601 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2732 event pairs, 0 based on Foata normal form. 8/564 useless extension candidates. Maximal degree in co-relation 865. Up to 59 conditions per place. [2024-11-09 06:27:43,806 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2024-11-09 06:27:43,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2024-11-09 06:27:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:27:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:27:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2024-11-09 06:27:43,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2024-11-09 06:27:43,808 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2024-11-09 06:27:43,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2024-11-09 06:27:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:43,814 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2024-11-09 06:27:43,814 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-09 06:27:43,814 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2024-11-09 06:27:43,815 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2024-11-09 06:27:43,815 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-09 06:27:43,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:43,815 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-09 06:27:43,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:27:44,016 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-09 06:27:44,016 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -237909861, now seen corresponding path program 1 times [2024-11-09 06:27:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572617823] [2024-11-09 06:27:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:44,137 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-09 06:27:44,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572617823] [2024-11-09 06:27:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572617823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547366955] [2024-11-09 06:27:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:44,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:44,140 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-09 06:27:44,141 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-09 06:27:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:44,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:27:44,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:44,361 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-09 06:27:44,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:44,450 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-09 06:27:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547366955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:27:44,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:27:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:27:44,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397829371] [2024-11-09 06:27:44,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:27:44,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:27:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:27:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:27:44,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-09 06:27:44,484 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-09 06:27:44,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:44,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-09 06:27:44,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:44,744 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2024-11-09 06:27:44,744 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2024-11-09 06:27:44,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 1310 events. 242/1310 cut-off events. For 1036/1068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6597 event pairs, 13 based on Foata normal form. 16/1267 useless extension candidates. Maximal degree in co-relation 2346. Up to 138 conditions per place. [2024-11-09 06:27:44,810 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2024-11-09 06:27:44,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2024-11-09 06:27:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 06:27:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 06:27:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2024-11-09 06:27:44,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2024-11-09 06:27:44,814 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2024-11-09 06:27:44,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2024-11-09 06:27:44,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:27:44,821 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2024-11-09 06:27:44,822 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-09 06:27:44,822 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2024-11-09 06:27:44,822 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2024-11-09 06:27:44,823 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-09 06:27:44,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:44,824 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-09 06:27:44,841 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-09 06:27:45,027 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-09 06:27:45,028 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:45,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1218412197, now seen corresponding path program 2 times [2024-11-09 06:27:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572635659] [2024-11-09 06:27:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:45,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:45,260 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-09 06:27:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572635659] [2024-11-09 06:27:45,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572635659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768358461] [2024-11-09 06:27:45,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:27:45,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:45,267 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-09 06:27:45,279 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-09 06:27:45,375 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:27:45,375 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:27:45,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:27:45,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:45,548 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-09 06:27:45,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:45,759 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-09 06:27:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768358461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:27:45,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:27:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 06:27:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336685530] [2024-11-09 06:27:45,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:27:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 06:27:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 06:27:45,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:27:45,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-09 06:27:45,786 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-09 06:27:45,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:45,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-09 06:27:45,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:46,439 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2024-11-09 06:27:46,440 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2024-11-09 06:27:46,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2170 events. 402/2170 cut-off events. For 1539/1571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10604 event pairs, 13 based on Foata normal form. 26/2135 useless extension candidates. Maximal degree in co-relation 3911. Up to 218 conditions per place. [2024-11-09 06:27:46,464 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2024-11-09 06:27:46,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2024-11-09 06:27:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:27:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-09 06:27:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2024-11-09 06:27:46,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2024-11-09 06:27:46,472 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2024-11-09 06:27:46,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2024-11-09 06:27:46,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-09 06:27:46,481 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2024-11-09 06:27:46,482 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-09 06:27:46,482 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2024-11-09 06:27:46,482 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2024-11-09 06:27:46,483 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-09 06:27:46,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:46,484 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-09 06:27:46,503 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-09 06:27:46,688 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-09 06:27:46,689 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash 557794011, now seen corresponding path program 3 times [2024-11-09 06:27:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263274754] [2024-11-09 06:27:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:47,409 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-09 06:27:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263274754] [2024-11-09 06:27:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263274754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101707841] [2024-11-09 06:27:47,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:27:47,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:47,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:47,415 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-09 06:27:47,423 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-09 06:27:47,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-09 06:27:47,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:27:47,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 06:27:47,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:48,166 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-09 06:27:48,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:48,784 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-09 06:27:48,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101707841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:27:48,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:27:48,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-09 06:27:48,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65037580] [2024-11-09 06:27:48,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:27:48,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 06:27:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 06:27:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 06:27:48,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-09 06:27:48,821 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-09 06:27:48,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:48,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-09 06:27:48,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:50,699 INFO L124 PetriNetUnfolderBase]: 722/3890 cut-off events. [2024-11-09 06:27:50,699 INFO L125 PetriNetUnfolderBase]: For 4577/4609 co-relation queries the response was YES. [2024-11-09 06:27:50,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 3890 events. 722/3890 cut-off events. For 4577/4609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 18669 event pairs, 13 based on Foata normal form. 46/3875 useless extension candidates. Maximal degree in co-relation 7457. Up to 378 conditions per place. [2024-11-09 06:27:50,753 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 291 selfloop transitions, 45 changer transitions 0/477 dead transitions. [2024-11-09 06:27:50,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 477 transitions, 3078 flow [2024-11-09 06:27:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-09 06:27:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-09 06:27:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7321 transitions. [2024-11-09 06:27:50,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8653664302600473 [2024-11-09 06:27:50,769 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 45 states and 7321 transitions. [2024-11-09 06:27:50,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 477 transitions, 3078 flow [2024-11-09 06:27:50,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 477 transitions, 3038 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-09 06:27:50,784 INFO L231 Difference]: Finished difference. Result has 243 places, 207 transitions, 848 flow [2024-11-09 06:27:50,785 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-09 06:27:50,785 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 59 predicate places. [2024-11-09 06:27:50,785 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 207 transitions, 848 flow [2024-11-09 06:27:50,790 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-09 06:27:50,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:50,791 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-09 06:27:50,810 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-09 06:27:50,994 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-09 06:27:50,995 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:50,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 178363133, now seen corresponding path program 4 times [2024-11-09 06:27:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721085597] [2024-11-09 06:27:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:27:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:52,459 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-09 06:27:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:27:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721085597] [2024-11-09 06:27:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721085597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:52,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501404652] [2024-11-09 06:27:52,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 06:27:52,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:27:52,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:27:52,463 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-09 06:27:52,464 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-09 06:27:52,636 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 06:27:52,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:27:52,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 06:27:52,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:53,291 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-09 06:27:53,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:54,642 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-09 06:27:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501404652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:27:54,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:27:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 55 [2024-11-09 06:27:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923021001] [2024-11-09 06:27:54,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:27:54,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-09 06:27:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:27:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-09 06:27:54,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 06:27:54,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2024-11-09 06:27:54,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 848 flow. Second operand has 55 states, 55 states have (on average 161.1090909090909) internal successors, (8861), 55 states have internal predecessors, (8861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:54,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:27:54,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2024-11-09 06:27:54,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:27:59,519 INFO L124 PetriNetUnfolderBase]: 1162/6255 cut-off events. [2024-11-09 06:27:59,520 INFO L125 PetriNetUnfolderBase]: For 14226/14258 co-relation queries the response was YES. [2024-11-09 06:27:59,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12692 conditions, 6255 events. 1162/6255 cut-off events. For 14226/14258 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 29737 event pairs, 13 based on Foata normal form. 61/6255 useless extension candidates. Maximal degree in co-relation 12668. Up to 598 conditions per place. [2024-11-09 06:27:59,606 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 500 selfloop transitions, 78 changer transitions 0/719 dead transitions. [2024-11-09 06:27:59,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 719 transitions, 5318 flow [2024-11-09 06:27:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-11-09 06:27:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2024-11-09 06:27:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 12681 transitions. [2024-11-09 06:27:59,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8647708674304418 [2024-11-09 06:27:59,628 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 848 flow. Second operand 78 states and 12681 transitions. [2024-11-09 06:27:59,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 719 transitions, 5318 flow [2024-11-09 06:27:59,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 719 transitions, 5240 flow, removed 21 selfloop flow, removed 18 redundant places. [2024-11-09 06:27:59,657 INFO L231 Difference]: Finished difference. Result has 314 places, 241 transitions, 1302 flow [2024-11-09 06:27:59,658 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=1302, PETRI_PLACES=314, PETRI_TRANSITIONS=241} [2024-11-09 06:27:59,658 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 130 predicate places. [2024-11-09 06:27:59,658 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 241 transitions, 1302 flow [2024-11-09 06:27:59,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 161.1090909090909) internal successors, (8861), 55 states have internal predecessors, (8861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:27:59,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:27:59,664 INFO L204 CegarLoopForPetriNet]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:59,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:27:59,868 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-09 06:27:59,869 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-09 06:27:59,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1753150897, now seen corresponding path program 5 times [2024-11-09 06:27:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:27:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266116876] [2024-11-09 06:27:59,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:28:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:28:00,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:28:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:28:00,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:28:00,850 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:28:00,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-09 06:28:00,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-09 06:28:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-09 06:28:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-09 06:28:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-09 06:28:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-09 06:28:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-09 06:28:00,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-09 06:28:00,855 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-09 06:28:00,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-09 06:28:00,857 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-09 06:28:00,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-09 06:28:00,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:28:00,859 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-09 06:28:01,141 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:28:01,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:28:01,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:28:01 BasicIcfg [2024-11-09 06:28:01,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:28:01,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:28:01,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:28:01,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:28:01,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:27:38" (3/4) ... [2024-11-09 06:28:01,150 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:28:01,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:28:01,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:28:01,493 INFO L158 Benchmark]: Toolchain (without parser) took 24178.40ms. Allocated memory was 222.3MB in the beginning and 675.3MB in the end (delta: 453.0MB). Free memory was 149.6MB in the beginning and 410.0MB in the end (delta: -260.4MB). Peak memory consumption was 428.9MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,493 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 222.3MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:28:01,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.44ms. Allocated memory is still 222.3MB. Free memory was 149.3MB in the beginning and 127.1MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.64ms. Allocated memory is still 222.3MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,494 INFO L158 Benchmark]: Boogie Preprocessor took 34.94ms. Allocated memory is still 222.3MB. Free memory was 125.0MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,494 INFO L158 Benchmark]: RCFGBuilder took 857.60ms. Allocated memory is still 222.3MB. Free memory was 123.5MB in the beginning and 172.9MB in the end (delta: -49.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,494 INFO L158 Benchmark]: TraceAbstraction took 22324.62ms. Allocated memory was 222.3MB in the beginning and 675.3MB in the end (delta: 453.0MB). Free memory was 171.9MB in the beginning and 233.8MB in the end (delta: -61.9MB). Peak memory consumption was 459.2MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,494 INFO L158 Benchmark]: Witness Printer took 343.79ms. Allocated memory is still 675.3MB. Free memory was 233.8MB in the beginning and 410.0MB in the end (delta: -176.2MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-11-09 06:28:01,495 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.32ms. Allocated memory is still 222.3MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.44ms. Allocated memory is still 222.3MB. Free memory was 149.3MB in the beginning and 127.1MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.64ms. Allocated memory is still 222.3MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.94ms. Allocated memory is still 222.3MB. Free memory was 125.0MB in the beginning and 123.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 857.60ms. Allocated memory is still 222.3MB. Free memory was 123.5MB in the beginning and 172.9MB in the end (delta: -49.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22324.62ms. Allocated memory was 222.3MB in the beginning and 675.3MB in the end (delta: 453.0MB). Free memory was 171.9MB in the beginning and 233.8MB in the end (delta: -61.9MB). Peak memory consumption was 459.2MB. Max. memory is 16.1GB. * Witness Printer took 343.79ms. Allocated memory is still 675.3MB. Free memory was 233.8MB in the beginning and 410.0MB in the end (delta: -176.2MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, cur=1, i=1, id1=-1, id2=0, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=17711, q=0, x=22] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=28657, q=0, x=23] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=121393, p=0, prev=46368, q=0, x=24] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=75025, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=24] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=24] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L706] COND TRUE 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=121393, p=0, prev=75025, q=0, x=25] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=196418, p=0, prev=75025, q=0, x=25] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=121393, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=25] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=25] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] 0 x < 26 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L706] COND FALSE 0 !(x < 26) VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=121393, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, correct=121393, cur=196418, i=1, id1=-1, id2=0, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, argc=196510, correct=121393, cur=196418, i=1, id1=-1, id2=0, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L688] COND TRUE 1 p < 12 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=1, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=196418, i=2, j=1, next=196418, p=0, prev=121393, q=0, x=26] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=196510, \old(argv)={196453:196476}, arg={0:0}, argc=196510, correct=121393, cur=196418, i=2, id1=-1, id2=0, j=1, next=196418, p=0, prev=121393, q=0, x=26] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 240 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.9s, OverallIterations: 24, TraceHistogramMax: 27, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1556 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1342 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1208 IncrementalHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 94 mSDtfsCounter, 1208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2716 GetRequests, 2478 SyntacticMatches, 11 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3769 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1302occurred in iteration=23, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 4499 NumberOfCodeBlocks, 4499 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4661 ConstructedInterpolants, 0 QuantifiedInterpolants, 10505 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 06:28:01,536 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