/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 07:52:55,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 07:52:55,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 07:52:55,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 07:52:55,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 07:52:55,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 07:52:55,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 07:52:55,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 07:52:55,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 07:52:55,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 07:52:55,436 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 07:52:55,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 07:52:55,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 07:52:55,436 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 07:52:55,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 07:52:55,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 07:52:55,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 07:52:55,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 07:52:55,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 07:52:55,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 07:52:55,438 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 07:52:55,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 07:52:55,438 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 07:52:55,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 07:52:55,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 07:52:55,439 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 07:52:55,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 07:52:55,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:52:55,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 07:52:55,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 07:52:55,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 07:52:55,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 07:52:55,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 07:52:55,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 07:52:55,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 07:52:55,441 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 07:52:55,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 07:52:55,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 07:52:55,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 07:52:55,697 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 07:52:55,698 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 07:52:55,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-26 07:52:56,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 07:52:56,937 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 07:52:56,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-26 07:52:56,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0918b01/a5ee54787f4a42d89faf43fd254cc0ff/FLAG08874f62b [2023-08-26 07:52:56,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0918b01/a5ee54787f4a42d89faf43fd254cc0ff [2023-08-26 07:52:56,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 07:52:56,974 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 07:52:56,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 07:52:56,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 07:52:56,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 07:52:56,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:52:56" (1/1) ... [2023-08-26 07:52:56,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3ff75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:56, skipping insertion in model container [2023-08-26 07:52:56,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:52:56" (1/1) ... [2023-08-26 07:52:57,014 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 07:52:57,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:52:57,343 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 07:52:57,366 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:52:57,367 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:52:57,372 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 07:52:57,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:52:57,443 INFO L206 MainTranslator]: Completed translation [2023-08-26 07:52:57,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57 WrapperNode [2023-08-26 07:52:57,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 07:52:57,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 07:52:57,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 07:52:57,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 07:52:57,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,507 INFO L138 Inliner]: procedures = 270, calls = 42, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 262 [2023-08-26 07:52:57,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 07:52:57,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 07:52:57,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 07:52:57,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 07:52:57,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,554 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 07:52:57,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 07:52:57,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 07:52:57,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 07:52:57,557 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (1/1) ... [2023-08-26 07:52:57,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:52:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:57,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 07:52:57,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 07:52:57,608 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 07:52:57,608 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 07:52:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 07:52:57,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 07:52:57,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 07:52:57,610 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 07:52:57,720 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 07:52:57,721 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 07:52:58,102 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 07:52:58,112 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 07:52:58,113 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-26 07:52:58,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:52:58 BoogieIcfgContainer [2023-08-26 07:52:58,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 07:52:58,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 07:52:58,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 07:52:58,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 07:52:58,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:52:56" (1/3) ... [2023-08-26 07:52:58,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ada0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:52:58, skipping insertion in model container [2023-08-26 07:52:58,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:57" (2/3) ... [2023-08-26 07:52:58,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ada0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:52:58, skipping insertion in model container [2023-08-26 07:52:58,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:52:58" (3/3) ... [2023-08-26 07:52:58,121 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-26 07:52:58,132 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 07:52:58,132 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-08-26 07:52:58,132 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 07:52:58,202 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 07:52:58,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 275 transitions, 558 flow [2023-08-26 07:52:58,343 INFO L124 PetriNetUnfolderBase]: 48/391 cut-off events. [2023-08-26 07:52:58,344 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:52:58,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 391 events. 48/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1646 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 227. Up to 8 conditions per place. [2023-08-26 07:52:58,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 275 transitions, 558 flow [2023-08-26 07:52:58,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 275 transitions, 558 flow [2023-08-26 07:52:58,362 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:52:58,374 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 275 transitions, 558 flow [2023-08-26 07:52:58,376 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 275 transitions, 558 flow [2023-08-26 07:52:58,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 275 transitions, 558 flow [2023-08-26 07:52:58,419 INFO L124 PetriNetUnfolderBase]: 48/391 cut-off events. [2023-08-26 07:52:58,419 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:52:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 391 events. 48/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1646 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 227. Up to 8 conditions per place. [2023-08-26 07:52:58,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 25864 [2023-08-26 07:53:00,911 INFO L134 LiptonReduction]: Checked pairs total: 113508 [2023-08-26 07:53:00,911 INFO L136 LiptonReduction]: Total number of compositions: 183 [2023-08-26 07:53:00,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:53:00,930 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@73899a81, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:53:00,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-08-26 07:53:00,934 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:53:00,934 INFO L124 PetriNetUnfolderBase]: 14/75 cut-off events. [2023-08-26 07:53:00,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:53:00,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:00,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:00,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:00,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1021694442, now seen corresponding path program 1 times [2023-08-26 07:53:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:00,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546158099] [2023-08-26 07:53:00,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:01,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546158099] [2023-08-26 07:53:01,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546158099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:53:01,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:53:01,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:53:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593538862] [2023-08-26 07:53:01,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:53:01,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:53:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:53:01,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:53:01,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 458 [2023-08-26 07:53:01,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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) [2023-08-26 07:53:01,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:01,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 458 [2023-08-26 07:53:01,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:01,321 INFO L124 PetriNetUnfolderBase]: 440/1670 cut-off events. [2023-08-26 07:53:01,321 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2023-08-26 07:53:01,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 1670 events. 440/1670 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 12290 event pairs, 396 based on Foata normal form. 172/1650 useless extension candidates. Maximal degree in co-relation 2436. Up to 860 conditions per place. [2023-08-26 07:53:01,328 INFO L140 encePairwiseOnDemand]: 434/458 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-08-26 07:53:01,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 330 flow [2023-08-26 07:53:01,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:53:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:53:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2023-08-26 07:53:01,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611353711790393 [2023-08-26 07:53:01,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 771 transitions. [2023-08-26 07:53:01,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 771 transitions. [2023-08-26 07:53:01,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:01,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 771 transitions. [2023-08-26 07:53:01,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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) [2023-08-26 07:53:01,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 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) [2023-08-26 07:53:01,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 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) [2023-08-26 07:53:01,350 INFO L175 Difference]: Start difference. First operand has 112 places, 134 transitions, 276 flow. Second operand 3 states and 771 transitions. [2023-08-26 07:53:01,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 330 flow [2023-08-26 07:53:01,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 330 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:53:01,355 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 246 flow [2023-08-26 07:53:01,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2023-08-26 07:53:01,358 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 3 predicate places. [2023-08-26 07:53:01,358 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 246 flow [2023-08-26 07:53:01,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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) [2023-08-26 07:53:01,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:01,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:01,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 07:53:01,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:01,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash 58107970, now seen corresponding path program 1 times [2023-08-26 07:53:01,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797534716] [2023-08-26 07:53:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797534716] [2023-08-26 07:53:01,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797534716] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:01,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166576688] [2023-08-26 07:53:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:01,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:01,429 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) [2023-08-26 07:53:01,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 07:53:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:01,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:53:01,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 07:53:01,553 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:53:01,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166576688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:53:01,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:53:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:53:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96786131] [2023-08-26 07:53:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:53:01,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:53:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:53:01,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:53:01,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 458 [2023-08-26 07:53:01,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2023-08-26 07:53:01,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:01,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 458 [2023-08-26 07:53:01,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:01,744 INFO L124 PetriNetUnfolderBase]: 438/1610 cut-off events. [2023-08-26 07:53:01,744 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 07:53:01,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 1610 events. 438/1610 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11658 event pairs, 315 based on Foata normal form. 0/1419 useless extension candidates. Maximal degree in co-relation 2461. Up to 822 conditions per place. [2023-08-26 07:53:01,751 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 64 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2023-08-26 07:53:01,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 133 transitions, 416 flow [2023-08-26 07:53:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:53:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:53:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2023-08-26 07:53:01,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5589519650655022 [2023-08-26 07:53:01,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2023-08-26 07:53:01,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2023-08-26 07:53:01,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:01,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2023-08-26 07:53:01,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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) [2023-08-26 07:53:01,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 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) [2023-08-26 07:53:01,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 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) [2023-08-26 07:53:01,760 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 246 flow. Second operand 3 states and 768 transitions. [2023-08-26 07:53:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 133 transitions, 416 flow [2023-08-26 07:53:01,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 412 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 07:53:01,765 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 250 flow [2023-08-26 07:53:01,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2023-08-26 07:53:01,770 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2023-08-26 07:53:01,770 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 250 flow [2023-08-26 07:53:01,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2023-08-26 07:53:01,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:01,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:01,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 07:53:01,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:01,983 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:01,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1169161537, now seen corresponding path program 1 times [2023-08-26 07:53:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517720058] [2023-08-26 07:53:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517720058] [2023-08-26 07:53:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517720058] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80517877] [2023-08-26 07:53:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:02,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:02,043 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) [2023-08-26 07:53:02,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 07:53:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:02,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:53:02,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:02,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:53:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80517877] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:53:02,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:53:02,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:53:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849541494] [2023-08-26 07:53:02,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:53:02,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:53:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:53:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:53:02,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 458 [2023-08-26 07:53:02,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 235.85714285714286) internal successors, (1651), 7 states have internal predecessors, (1651), 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) [2023-08-26 07:53:02,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:02,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 458 [2023-08-26 07:53:02,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:02,328 INFO L124 PetriNetUnfolderBase]: 438/1618 cut-off events. [2023-08-26 07:53:02,329 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-26 07:53:02,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 1618 events. 438/1618 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11780 event pairs, 396 based on Foata normal form. 3/1442 useless extension candidates. Maximal degree in co-relation 2511. Up to 842 conditions per place. [2023-08-26 07:53:02,334 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 45 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2023-08-26 07:53:02,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 362 flow [2023-08-26 07:53:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:53:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:53:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1457 transitions. [2023-08-26 07:53:02,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302037845705968 [2023-08-26 07:53:02,338 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1457 transitions. [2023-08-26 07:53:02,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1457 transitions. [2023-08-26 07:53:02,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:02,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1457 transitions. [2023-08-26 07:53:02,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 242.83333333333334) internal successors, (1457), 6 states have internal predecessors, (1457), 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) [2023-08-26 07:53:02,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:53:02,344 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:53:02,344 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 250 flow. Second operand 6 states and 1457 transitions. [2023-08-26 07:53:02,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 362 flow [2023-08-26 07:53:02,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 117 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 07:53:02,348 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 282 flow [2023-08-26 07:53:02,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2023-08-26 07:53:02,349 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 11 predicate places. [2023-08-26 07:53:02,349 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 282 flow [2023-08-26 07:53:02,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.85714285714286) internal successors, (1651), 7 states have internal predecessors, (1651), 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) [2023-08-26 07:53:02,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:02,350 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:02,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 07:53:02,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-26 07:53:02,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:02,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1841468163, now seen corresponding path program 2 times [2023-08-26 07:53:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:02,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012461331] [2023-08-26 07:53:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:02,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012461331] [2023-08-26 07:53:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012461331] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362127505] [2023-08-26 07:53:02,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:53:02,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:02,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:02,669 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) [2023-08-26 07:53:02,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 07:53:02,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:53:02,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:53:02,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 07:53:02,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:02,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:53:02,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 07:53:02,798 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:53:02,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:53:02,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:53:02,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:53:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 07:53:02,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:53:02,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362127505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:53:02,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:53:02,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 07:53:02,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052328323] [2023-08-26 07:53:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:53:02,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:53:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:53:02,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:53:02,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 458 [2023-08-26 07:53:02,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 282 flow. Second operand has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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) [2023-08-26 07:53:02,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:02,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 458 [2023-08-26 07:53:02,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:03,800 INFO L124 PetriNetUnfolderBase]: 2907/6041 cut-off events. [2023-08-26 07:53:03,800 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-08-26 07:53:03,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12046 conditions, 6041 events. 2907/6041 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 39541 event pairs, 1236 based on Foata normal form. 0/5195 useless extension candidates. Maximal degree in co-relation 12011. Up to 3773 conditions per place. [2023-08-26 07:53:03,822 INFO L140 encePairwiseOnDemand]: 429/458 looper letters, 290 selfloop transitions, 50 changer transitions 0/350 dead transitions. [2023-08-26 07:53:03,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 350 transitions, 1443 flow [2023-08-26 07:53:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:53:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:53:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1347 transitions. [2023-08-26 07:53:03,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490174672489083 [2023-08-26 07:53:03,832 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1347 transitions. [2023-08-26 07:53:03,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1347 transitions. [2023-08-26 07:53:03,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:03,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1347 transitions. [2023-08-26 07:53:03,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.5) internal successors, (1347), 6 states have internal predecessors, (1347), 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) [2023-08-26 07:53:03,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:53:03,839 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:53:03,839 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 282 flow. Second operand 6 states and 1347 transitions. [2023-08-26 07:53:03,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 350 transitions, 1443 flow [2023-08-26 07:53:03,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 350 transitions, 1429 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:53:03,847 INFO L231 Difference]: Finished difference. Result has 132 places, 164 transitions, 614 flow [2023-08-26 07:53:03,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=132, PETRI_TRANSITIONS=164} [2023-08-26 07:53:03,848 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2023-08-26 07:53:03,848 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 164 transitions, 614 flow [2023-08-26 07:53:03,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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) [2023-08-26 07:53:03,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:03,849 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:03,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 07:53:04,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:04,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:04,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:04,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1841468388, now seen corresponding path program 1 times [2023-08-26 07:53:04,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:04,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381232961] [2023-08-26 07:53:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381232961] [2023-08-26 07:53:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381232961] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463581746] [2023-08-26 07:53:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:04,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:04,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:04,150 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) [2023-08-26 07:53:04,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 07:53:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:04,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:53:04,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:04,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:53:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:53:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463581746] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:53:04,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:53:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 07:53:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354789357] [2023-08-26 07:53:04,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:53:04,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:53:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:53:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 07:53:04,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 458 [2023-08-26 07:53:04,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 164 transitions, 614 flow. Second operand has 13 states, 13 states have (on average 235.53846153846155) internal successors, (3062), 13 states have internal predecessors, (3062), 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) [2023-08-26 07:53:04,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:04,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 458 [2023-08-26 07:53:04,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:04,518 INFO L124 PetriNetUnfolderBase]: 758/2649 cut-off events. [2023-08-26 07:53:04,518 INFO L125 PetriNetUnfolderBase]: For 594/634 co-relation queries the response was YES. [2023-08-26 07:53:04,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 2649 events. 758/2649 cut-off events. For 594/634 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 20088 event pairs, 443 based on Foata normal form. 25/2398 useless extension candidates. Maximal degree in co-relation 5262. Up to 1247 conditions per place. [2023-08-26 07:53:04,530 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 58 selfloop transitions, 11 changer transitions 0/170 dead transitions. [2023-08-26 07:53:04,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 170 transitions, 788 flow [2023-08-26 07:53:04,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:53:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:53:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2870 transitions. [2023-08-26 07:53:04,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522197962154294 [2023-08-26 07:53:04,536 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2870 transitions. [2023-08-26 07:53:04,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2870 transitions. [2023-08-26 07:53:04,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:04,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2870 transitions. [2023-08-26 07:53:04,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 239.16666666666666) internal successors, (2870), 12 states have internal predecessors, (2870), 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) [2023-08-26 07:53:04,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 458.0) internal successors, (5954), 13 states have internal predecessors, (5954), 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) [2023-08-26 07:53:04,547 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 458.0) internal successors, (5954), 13 states have internal predecessors, (5954), 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) [2023-08-26 07:53:04,548 INFO L175 Difference]: Start difference. First operand has 132 places, 164 transitions, 614 flow. Second operand 12 states and 2870 transitions. [2023-08-26 07:53:04,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 170 transitions, 788 flow [2023-08-26 07:53:04,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 170 transitions, 788 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:53:04,552 INFO L231 Difference]: Finished difference. Result has 149 places, 170 transitions, 698 flow [2023-08-26 07:53:04,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=698, PETRI_PLACES=149, PETRI_TRANSITIONS=170} [2023-08-26 07:53:04,553 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 37 predicate places. [2023-08-26 07:53:04,553 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 170 transitions, 698 flow [2023-08-26 07:53:04,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 235.53846153846155) internal successors, (3062), 13 states have internal predecessors, (3062), 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) [2023-08-26 07:53:04,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:04,554 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:04,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-26 07:53:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:04,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:04,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1393769060, now seen corresponding path program 2 times [2023-08-26 07:53:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:04,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102904028] [2023-08-26 07:53:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102904028] [2023-08-26 07:53:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102904028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:53:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:53:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:53:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491984299] [2023-08-26 07:53:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:53:04,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:53:04,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:53:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:53:04,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 458 [2023-08-26 07:53:04,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 170 transitions, 698 flow. Second operand has 7 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 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) [2023-08-26 07:53:04,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:04,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 458 [2023-08-26 07:53:04,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:05,897 INFO L124 PetriNetUnfolderBase]: 3435/7279 cut-off events. [2023-08-26 07:53:05,897 INFO L125 PetriNetUnfolderBase]: For 2433/2433 co-relation queries the response was YES. [2023-08-26 07:53:05,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18324 conditions, 7279 events. 3435/7279 cut-off events. For 2433/2433 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 49345 event pairs, 1042 based on Foata normal form. 0/6450 useless extension candidates. Maximal degree in co-relation 18242. Up to 5246 conditions per place. [2023-08-26 07:53:06,009 INFO L140 encePairwiseOnDemand]: 448/458 looper letters, 359 selfloop transitions, 17 changer transitions 19/403 dead transitions. [2023-08-26 07:53:06,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 403 transitions, 2268 flow [2023-08-26 07:53:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 07:53:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 07:53:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1686 transitions. [2023-08-26 07:53:06,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3681222707423581 [2023-08-26 07:53:06,013 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1686 transitions. [2023-08-26 07:53:06,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1686 transitions. [2023-08-26 07:53:06,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:06,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1686 transitions. [2023-08-26 07:53:06,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 168.6) internal successors, (1686), 10 states have internal predecessors, (1686), 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) [2023-08-26 07:53:06,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 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) [2023-08-26 07:53:06,021 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 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) [2023-08-26 07:53:06,022 INFO L175 Difference]: Start difference. First operand has 149 places, 170 transitions, 698 flow. Second operand 10 states and 1686 transitions. [2023-08-26 07:53:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 403 transitions, 2268 flow [2023-08-26 07:53:06,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 403 transitions, 2220 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:53:06,041 INFO L231 Difference]: Finished difference. Result has 160 places, 185 transitions, 778 flow [2023-08-26 07:53:06,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=778, PETRI_PLACES=160, PETRI_TRANSITIONS=185} [2023-08-26 07:53:06,043 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 48 predicate places. [2023-08-26 07:53:06,044 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 185 transitions, 778 flow [2023-08-26 07:53:06,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 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) [2023-08-26 07:53:06,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:06,044 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:06,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 07:53:06,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:06,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1162893375, now seen corresponding path program 1 times [2023-08-26 07:53:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830836120] [2023-08-26 07:53:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:06,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:06,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830836120] [2023-08-26 07:53:06,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830836120] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:06,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697136271] [2023-08-26 07:53:06,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:06,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:06,094 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) [2023-08-26 07:53:06,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 07:53:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:06,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:53:06,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:06,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:53:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697136271] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:53:06,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:53:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 07:53:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403705679] [2023-08-26 07:53:06,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:53:06,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:53:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:53:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:53:06,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 458 [2023-08-26 07:53:06,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 185 transitions, 778 flow. Second operand has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 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) [2023-08-26 07:53:06,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:06,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 458 [2023-08-26 07:53:06,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:06,239 INFO L124 PetriNetUnfolderBase]: 36/178 cut-off events. [2023-08-26 07:53:06,239 INFO L125 PetriNetUnfolderBase]: For 173/174 co-relation queries the response was YES. [2023-08-26 07:53:06,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 178 events. 36/178 cut-off events. For 173/174 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 551 event pairs, 0 based on Foata normal form. 20/189 useless extension candidates. Maximal degree in co-relation 488. Up to 82 conditions per place. [2023-08-26 07:53:06,240 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 40 selfloop transitions, 2 changer transitions 13/83 dead transitions. [2023-08-26 07:53:06,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 83 transitions, 460 flow [2023-08-26 07:53:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 07:53:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 07:53:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 979 transitions. [2023-08-26 07:53:06,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343886462882096 [2023-08-26 07:53:06,242 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 979 transitions. [2023-08-26 07:53:06,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 979 transitions. [2023-08-26 07:53:06,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:06,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 979 transitions. [2023-08-26 07:53:06,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.75) internal successors, (979), 4 states have internal predecessors, (979), 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) [2023-08-26 07:53:06,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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) [2023-08-26 07:53:06,246 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 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) [2023-08-26 07:53:06,246 INFO L175 Difference]: Start difference. First operand has 160 places, 185 transitions, 778 flow. Second operand 4 states and 979 transitions. [2023-08-26 07:53:06,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 83 transitions, 460 flow [2023-08-26 07:53:06,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 366 flow, removed 11 selfloop flow, removed 18 redundant places. [2023-08-26 07:53:06,248 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 189 flow [2023-08-26 07:53:06,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2023-08-26 07:53:06,249 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -30 predicate places. [2023-08-26 07:53:06,249 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 58 transitions, 189 flow [2023-08-26 07:53:06,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 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) [2023-08-26 07:53:06,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:06,250 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:06,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 07:53:06,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:06,457 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:06,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:06,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1771073285, now seen corresponding path program 1 times [2023-08-26 07:53:06,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:06,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544319591] [2023-08-26 07:53:06,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:06,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544319591] [2023-08-26 07:53:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544319591] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450879160] [2023-08-26 07:53:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:06,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:06,699 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) [2023-08-26 07:53:06,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 07:53:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:06,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 07:53:06,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:06,789 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:53:06,853 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:53:06,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:53:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:53:06,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:53:06,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:53:06,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:53:06,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-08-26 07:53:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:06,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:53:10,977 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_385 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_385) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 07:53:12,988 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_385 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_385) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 07:53:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 07:53:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450879160] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:53:13,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:53:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-26 07:53:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930285400] [2023-08-26 07:53:13,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:53:13,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 07:53:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 07:53:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=101, Unknown=4, NotChecked=42, Total=182 [2023-08-26 07:53:13,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 458 [2023-08-26 07:53:13,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 58 transitions, 189 flow. Second operand has 14 states, 14 states have (on average 140.35714285714286) internal successors, (1965), 14 states have internal predecessors, (1965), 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) [2023-08-26 07:53:13,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:13,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 458 [2023-08-26 07:53:13,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:35,134 WARN L234 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 24 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:53:37,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:39,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:41,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:43,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:45,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:47,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:49,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:51,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:23,236 WARN L234 SmtUtils]: Spent 32.06s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:54:25,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:27,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:29,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:31,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:33,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:35,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:37,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:54:37,397 INFO L124 PetriNetUnfolderBase]: 63/200 cut-off events. [2023-08-26 07:54:37,397 INFO L125 PetriNetUnfolderBase]: For 164/165 co-relation queries the response was YES. [2023-08-26 07:54:37,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 200 events. 63/200 cut-off events. For 164/165 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 449 event pairs, 7 based on Foata normal form. 2/193 useless extension candidates. Maximal degree in co-relation 486. Up to 107 conditions per place. [2023-08-26 07:54:37,398 INFO L140 encePairwiseOnDemand]: 449/458 looper letters, 46 selfloop transitions, 9 changer transitions 8/66 dead transitions. [2023-08-26 07:54:37,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 66 transitions, 347 flow [2023-08-26 07:54:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 07:54:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 07:54:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1156 transitions. [2023-08-26 07:54:37,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3155021834061135 [2023-08-26 07:54:37,400 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1156 transitions. [2023-08-26 07:54:37,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1156 transitions. [2023-08-26 07:54:37,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:37,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1156 transitions. [2023-08-26 07:54:37,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.5) internal successors, (1156), 8 states have internal predecessors, (1156), 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) [2023-08-26 07:54:37,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 458.0) internal successors, (4122), 9 states have internal predecessors, (4122), 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) [2023-08-26 07:54:37,409 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 458.0) internal successors, (4122), 9 states have internal predecessors, (4122), 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) [2023-08-26 07:54:37,409 INFO L175 Difference]: Start difference. First operand has 82 places, 58 transitions, 189 flow. Second operand 8 states and 1156 transitions. [2023-08-26 07:54:37,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 66 transitions, 347 flow [2023-08-26 07:54:37,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 66 transitions, 335 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 07:54:37,411 INFO L231 Difference]: Finished difference. Result has 81 places, 54 transitions, 209 flow [2023-08-26 07:54:37,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=81, PETRI_TRANSITIONS=54} [2023-08-26 07:54:37,411 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -31 predicate places. [2023-08-26 07:54:37,411 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 54 transitions, 209 flow [2023-08-26 07:54:37,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 140.35714285714286) internal successors, (1965), 14 states have internal predecessors, (1965), 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) [2023-08-26 07:54:37,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:37,412 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:37,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 07:54:37,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:37,613 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:54:37,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:37,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1644331606, now seen corresponding path program 1 times [2023-08-26 07:54:37,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:37,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391659246] [2023-08-26 07:54:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:37,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:54:37,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:37,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391659246] [2023-08-26 07:54:37,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391659246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:37,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:54:37,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:54:37,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567012895] [2023-08-26 07:54:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:37,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:54:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:37,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:54:37,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:54:37,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 458 [2023-08-26 07:54:37,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 54 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 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) [2023-08-26 07:54:37,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:37,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 458 [2023-08-26 07:54:37,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:37,959 INFO L124 PetriNetUnfolderBase]: 58/178 cut-off events. [2023-08-26 07:54:37,960 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-26 07:54:37,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 178 events. 58/178 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 42 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 470. Up to 143 conditions per place. [2023-08-26 07:54:37,960 INFO L140 encePairwiseOnDemand]: 452/458 looper letters, 53 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-26 07:54:37,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 61 transitions, 359 flow [2023-08-26 07:54:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:54:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:54:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1039 transitions. [2023-08-26 07:54:37,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37809315866084425 [2023-08-26 07:54:37,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1039 transitions. [2023-08-26 07:54:37,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1039 transitions. [2023-08-26 07:54:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:37,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1039 transitions. [2023-08-26 07:54:37,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.16666666666666) internal successors, (1039), 6 states have internal predecessors, (1039), 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) [2023-08-26 07:54:37,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:54:37,967 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:54:37,967 INFO L175 Difference]: Start difference. First operand has 81 places, 54 transitions, 209 flow. Second operand 6 states and 1039 transitions. [2023-08-26 07:54:37,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 61 transitions, 359 flow [2023-08-26 07:54:37,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 61 transitions, 349 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 07:54:37,969 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 207 flow [2023-08-26 07:54:37,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-08-26 07:54:37,970 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -38 predicate places. [2023-08-26 07:54:37,970 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 207 flow [2023-08-26 07:54:37,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 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) [2023-08-26 07:54:37,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:37,971 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:37,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 07:54:37,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:54:37,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1126321599, now seen corresponding path program 1 times [2023-08-26 07:54:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832501999] [2023-08-26 07:54:37,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:54:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832501999] [2023-08-26 07:54:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832501999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:54:38,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:54:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754311248] [2023-08-26 07:54:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:38,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:54:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:54:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:54:38,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 458 [2023-08-26 07:54:38,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 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) [2023-08-26 07:54:38,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:38,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 458 [2023-08-26 07:54:38,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:38,327 INFO L124 PetriNetUnfolderBase]: 56/173 cut-off events. [2023-08-26 07:54:38,327 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-26 07:54:38,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 173 events. 56/173 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 317 event pairs, 42 based on Foata normal form. 3/175 useless extension candidates. Maximal degree in co-relation 463. Up to 143 conditions per place. [2023-08-26 07:54:38,328 INFO L140 encePairwiseOnDemand]: 453/458 looper letters, 0 selfloop transitions, 0 changer transitions 60/60 dead transitions. [2023-08-26 07:54:38,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 60 transitions, 355 flow [2023-08-26 07:54:38,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:54:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:54:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1038 transitions. [2023-08-26 07:54:38,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3777292576419214 [2023-08-26 07:54:38,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1038 transitions. [2023-08-26 07:54:38,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1038 transitions. [2023-08-26 07:54:38,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:38,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1038 transitions. [2023-08-26 07:54:38,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 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) [2023-08-26 07:54:38,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:54:38,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 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) [2023-08-26 07:54:38,334 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 207 flow. Second operand 6 states and 1038 transitions. [2023-08-26 07:54:38,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 60 transitions, 355 flow [2023-08-26 07:54:38,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 60 transitions, 345 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 07:54:38,335 INFO L231 Difference]: Finished difference. Result has 73 places, 0 transitions, 0 flow [2023-08-26 07:54:38,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=73, PETRI_TRANSITIONS=0} [2023-08-26 07:54:38,336 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -39 predicate places. [2023-08-26 07:54:38,336 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 0 transitions, 0 flow [2023-08-26 07:54:38,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 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) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONASSERT (13 of 19 remaining) [2023-08-26 07:54:38,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONASSERT (7 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONASSERT (4 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-08-26 07:54:38,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-08-26 07:54:38,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 07:54:38,339 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:38,340 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 07:54:38,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 275 transitions, 558 flow [2023-08-26 07:54:38,363 INFO L124 PetriNetUnfolderBase]: 48/391 cut-off events. [2023-08-26 07:54:38,364 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:54:38,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 391 events. 48/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1646 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 227. Up to 8 conditions per place. [2023-08-26 07:54:38,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 275 transitions, 558 flow [2023-08-26 07:54:38,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 270 transitions, 545 flow [2023-08-26 07:54:38,367 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:54:38,367 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 270 transitions, 545 flow [2023-08-26 07:54:38,367 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 270 transitions, 545 flow [2023-08-26 07:54:38,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 270 transitions, 545 flow [2023-08-26 07:54:38,386 INFO L124 PetriNetUnfolderBase]: 47/386 cut-off events. [2023-08-26 07:54:38,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:54:38,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 386 events. 47/386 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1580 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 227. Up to 8 conditions per place. [2023-08-26 07:54:38,394 INFO L119 LiptonReduction]: Number of co-enabled transitions 25864 [2023-08-26 07:54:40,554 INFO L134 LiptonReduction]: Checked pairs total: 114541 [2023-08-26 07:54:40,554 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-26 07:54:40,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 07:54:40,555 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@73899a81, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:54:40,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 07:54:40,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:54:40,557 INFO L124 PetriNetUnfolderBase]: 9/40 cut-off events. [2023-08-26 07:54:40,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:54:40,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:40,557 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-26 07:54:40,557 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:54:40,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1032765349, now seen corresponding path program 1 times [2023-08-26 07:54:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393437188] [2023-08-26 07:54:40,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393437188] [2023-08-26 07:54:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393437188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:54:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:54:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988045099] [2023-08-26 07:54:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:40,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:54:40,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:40,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:54:40,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:54:40,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 461 [2023-08-26 07:54:40,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 133 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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) [2023-08-26 07:54:40,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:40,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 461 [2023-08-26 07:54:40,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:40,677 INFO L124 PetriNetUnfolderBase]: 420/1608 cut-off events. [2023-08-26 07:54:40,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:54:40,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2435 conditions, 1608 events. 420/1608 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 11770 event pairs, 378 based on Foata normal form. 184/1625 useless extension candidates. Maximal degree in co-relation 2340. Up to 820 conditions per place. [2023-08-26 07:54:40,680 INFO L140 encePairwiseOnDemand]: 435/461 looper letters, 24 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2023-08-26 07:54:40,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 315 flow [2023-08-26 07:54:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:54:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:54:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 770 transitions. [2023-08-26 07:54:40,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556760665220535 [2023-08-26 07:54:40,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 770 transitions. [2023-08-26 07:54:40,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 770 transitions. [2023-08-26 07:54:40,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:40,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 770 transitions. [2023-08-26 07:54:40,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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) [2023-08-26 07:54:40,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 461.0) internal successors, (1844), 4 states have internal predecessors, (1844), 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) [2023-08-26 07:54:40,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 461.0) internal successors, (1844), 4 states have internal predecessors, (1844), 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) [2023-08-26 07:54:40,684 INFO L175 Difference]: Start difference. First operand has 111 places, 133 transitions, 271 flow. Second operand 3 states and 770 transitions. [2023-08-26 07:54:40,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 315 flow [2023-08-26 07:54:40,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 315 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:54:40,686 INFO L231 Difference]: Finished difference. Result has 113 places, 57 transitions, 129 flow [2023-08-26 07:54:40,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=113, PETRI_TRANSITIONS=57} [2023-08-26 07:54:40,686 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 2 predicate places. [2023-08-26 07:54:40,686 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 57 transitions, 129 flow [2023-08-26 07:54:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 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) [2023-08-26 07:54:40,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:40,687 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 07:54:40,687 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:54:40,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1647518810, now seen corresponding path program 1 times [2023-08-26 07:54:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609585421] [2023-08-26 07:54:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:40,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:40,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609585421] [2023-08-26 07:54:40,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609585421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:40,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549123808] [2023-08-26 07:54:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:40,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:40,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:40,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:54:40,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 07:54:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:40,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:54:40,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:40,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549123808] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:40,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:40,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 07:54:40,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068811200] [2023-08-26 07:54:40,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:40,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:54:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:40,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:54:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:54:40,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 461 [2023-08-26 07:54:40,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 57 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 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) [2023-08-26 07:54:40,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:40,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 461 [2023-08-26 07:54:40,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:40,846 INFO L124 PetriNetUnfolderBase]: 59/261 cut-off events. [2023-08-26 07:54:40,846 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:54:40,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 261 events. 59/261 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 909 event pairs, 54 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 405. Up to 136 conditions per place. [2023-08-26 07:54:40,847 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 24 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-26 07:54:40,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 199 flow [2023-08-26 07:54:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:54:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:54:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1436 transitions. [2023-08-26 07:54:40,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5191612436731743 [2023-08-26 07:54:40,850 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1436 transitions. [2023-08-26 07:54:40,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1436 transitions. [2023-08-26 07:54:40,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:40,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1436 transitions. [2023-08-26 07:54:40,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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) [2023-08-26 07:54:40,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 461.0) internal successors, (3227), 7 states have internal predecessors, (3227), 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) [2023-08-26 07:54:40,855 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 461.0) internal successors, (3227), 7 states have internal predecessors, (3227), 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) [2023-08-26 07:54:40,855 INFO L175 Difference]: Start difference. First operand has 113 places, 57 transitions, 129 flow. Second operand 6 states and 1436 transitions. [2023-08-26 07:54:40,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 199 flow [2023-08-26 07:54:40,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 195 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 07:54:40,856 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 161 flow [2023-08-26 07:54:40,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2023-08-26 07:54:40,857 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -44 predicate places. [2023-08-26 07:54:40,857 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 161 flow [2023-08-26 07:54:40,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.5) internal successors, (1413), 6 states have internal predecessors, (1413), 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) [2023-08-26 07:54:40,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:40,858 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-26 07:54:40,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 07:54:41,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:41,064 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:54:41,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1781938149, now seen corresponding path program 2 times [2023-08-26 07:54:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824238423] [2023-08-26 07:54:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824238423] [2023-08-26 07:54:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824238423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010190628] [2023-08-26 07:54:41,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:54:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:41,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:54:41,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 07:54:41,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:54:41,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:54:41,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:54:41,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:41,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:54:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010190628] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:41,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 07:54:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512429573] [2023-08-26 07:54:41,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:41,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 07:54:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:41,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 07:54:41,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 07:54:41,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 461 [2023-08-26 07:54:41,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 161 flow. Second operand has 12 states, 12 states have (on average 235.25) internal successors, (2823), 12 states have internal predecessors, (2823), 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) [2023-08-26 07:54:41,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:41,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 461 [2023-08-26 07:54:41,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:41,295 INFO L124 PetriNetUnfolderBase]: 59/267 cut-off events. [2023-08-26 07:54:41,295 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 07:54:41,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 267 events. 59/267 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 909 event pairs, 54 based on Foata normal form. 6/245 useless extension candidates. Maximal degree in co-relation 396. Up to 136 conditions per place. [2023-08-26 07:54:41,296 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 24 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2023-08-26 07:54:41,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 267 flow [2023-08-26 07:54:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:54:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:54:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2849 transitions. [2023-08-26 07:54:41,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515003615328995 [2023-08-26 07:54:41,300 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2849 transitions. [2023-08-26 07:54:41,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2849 transitions. [2023-08-26 07:54:41,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:41,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2849 transitions. [2023-08-26 07:54:41,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 237.41666666666666) internal successors, (2849), 12 states have internal predecessors, (2849), 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) [2023-08-26 07:54:41,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 461.0) internal successors, (5993), 13 states have internal predecessors, (5993), 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) [2023-08-26 07:54:41,310 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 461.0) internal successors, (5993), 13 states have internal predecessors, (5993), 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) [2023-08-26 07:54:41,311 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 161 flow. Second operand 12 states and 2849 transitions. [2023-08-26 07:54:41,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 267 flow [2023-08-26 07:54:41,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 66 transitions, 253 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:54:41,312 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 231 flow [2023-08-26 07:54:41,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=231, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2023-08-26 07:54:41,313 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -28 predicate places. [2023-08-26 07:54:41,313 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 231 flow [2023-08-26 07:54:41,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 235.25) internal successors, (2823), 12 states have internal predecessors, (2823), 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) [2023-08-26 07:54:41,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:41,313 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-26 07:54:41,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-26 07:54:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 07:54:41,518 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:54:41,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash 558305211, now seen corresponding path program 3 times [2023-08-26 07:54:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123829870] [2023-08-26 07:54:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 07:54:41,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 07:54:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 07:54:41,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 07:54:41,570 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 07:54:41,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 07:54:41,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 07:54:41,570 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-26 07:54:41,571 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 07:54:41,571 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 07:54:41,571 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 07:54:41,608 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 07:54:41,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 383 transitions, 784 flow [2023-08-26 07:54:41,659 INFO L124 PetriNetUnfolderBase]: 80/646 cut-off events. [2023-08-26 07:54:41,659 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 07:54:41,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 646 events. 80/646 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3301 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2023-08-26 07:54:41,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 383 transitions, 784 flow [2023-08-26 07:54:41,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 340 places, 383 transitions, 784 flow [2023-08-26 07:54:41,667 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:54:41,667 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 383 transitions, 784 flow [2023-08-26 07:54:41,668 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 383 transitions, 784 flow [2023-08-26 07:54:41,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 383 transitions, 784 flow [2023-08-26 07:54:41,716 INFO L124 PetriNetUnfolderBase]: 80/646 cut-off events. [2023-08-26 07:54:41,716 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 07:54:41,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 646 events. 80/646 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3301 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 393. Up to 12 conditions per place. [2023-08-26 07:54:41,739 INFO L119 LiptonReduction]: Number of co-enabled transitions 76532 [2023-08-26 07:54:44,633 INFO L134 LiptonReduction]: Checked pairs total: 269810 [2023-08-26 07:54:44,633 INFO L136 LiptonReduction]: Total number of compositions: 250 [2023-08-26 07:54:44,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:54:44,634 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@73899a81, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:54:44,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-26 07:54:44,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:54:44,637 INFO L124 PetriNetUnfolderBase]: 17/78 cut-off events. [2023-08-26 07:54:44,637 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:54:44,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:44,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:44,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:54:44,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash -120737980, now seen corresponding path program 1 times [2023-08-26 07:54:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:44,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945424807] [2023-08-26 07:54:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:54:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945424807] [2023-08-26 07:54:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945424807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:54:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:54:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363917152] [2023-08-26 07:54:44,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:44,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:54:44,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:44,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:54:44,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:54:44,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 633 [2023-08-26 07:54:44,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 196 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 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) [2023-08-26 07:54:44,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:44,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 633 [2023-08-26 07:54:44,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:46,926 INFO L124 PetriNetUnfolderBase]: 17119/40364 cut-off events. [2023-08-26 07:54:46,926 INFO L125 PetriNetUnfolderBase]: For 182/233 co-relation queries the response was YES. [2023-08-26 07:54:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65243 conditions, 40364 events. 17119/40364 cut-off events. For 182/233 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 450808 event pairs, 15876 based on Foata normal form. 4610/40467 useless extension candidates. Maximal degree in co-relation 29495. Up to 24758 conditions per place. [2023-08-26 07:54:47,081 INFO L140 encePairwiseOnDemand]: 599/633 looper letters, 65 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-08-26 07:54:47,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 166 transitions, 484 flow [2023-08-26 07:54:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:54:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:54:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1077 transitions. [2023-08-26 07:54:47,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5671406003159558 [2023-08-26 07:54:47,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1077 transitions. [2023-08-26 07:54:47,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1077 transitions. [2023-08-26 07:54:47,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:47,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1077 transitions. [2023-08-26 07:54:47,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 359.0) internal successors, (1077), 3 states have internal predecessors, (1077), 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) [2023-08-26 07:54:47,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 633.0) internal successors, (2532), 4 states have internal predecessors, (2532), 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) [2023-08-26 07:54:47,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 633.0) internal successors, (2532), 4 states have internal predecessors, (2532), 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) [2023-08-26 07:54:47,087 INFO L175 Difference]: Start difference. First operand has 164 places, 196 transitions, 410 flow. Second operand 3 states and 1077 transitions. [2023-08-26 07:54:47,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 166 transitions, 484 flow [2023-08-26 07:54:47,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:54:47,089 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 360 flow [2023-08-26 07:54:47,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2023-08-26 07:54:47,090 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 3 predicate places. [2023-08-26 07:54:47,090 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 360 flow [2023-08-26 07:54:47,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.6666666666667) internal successors, (983), 3 states have internal predecessors, (983), 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) [2023-08-26 07:54:47,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:47,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 07:54:47,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:54:47,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:47,090 INFO L85 PathProgramCache]: Analyzing trace with hash -134252717, now seen corresponding path program 1 times [2023-08-26 07:54:47,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164427909] [2023-08-26 07:54:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:54:47,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:47,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164427909] [2023-08-26 07:54:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164427909] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:47,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771609162] [2023-08-26 07:54:47,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:47,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:47,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:47,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:54:47,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 07:54:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:47,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:54:47,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 07:54:47,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:54:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771609162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:47,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:54:47,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:54:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699303522] [2023-08-26 07:54:47,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:47,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:54:47,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:47,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:54:47,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:54:47,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 633 [2023-08-26 07:54:47,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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) [2023-08-26 07:54:47,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:47,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 633 [2023-08-26 07:54:47,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:49,716 INFO L124 PetriNetUnfolderBase]: 16700/40363 cut-off events. [2023-08-26 07:54:49,716 INFO L125 PetriNetUnfolderBase]: For 158/178 co-relation queries the response was YES. [2023-08-26 07:54:49,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65251 conditions, 40363 events. 16700/40363 cut-off events. For 158/178 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 457991 event pairs, 7596 based on Foata normal form. 0/35867 useless extension candidates. Maximal degree in co-relation 65238. Up to 24720 conditions per place. [2023-08-26 07:54:49,867 INFO L140 encePairwiseOnDemand]: 630/633 looper letters, 85 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-08-26 07:54:49,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 186 transitions, 574 flow [2023-08-26 07:54:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:54:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:54:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1065 transitions. [2023-08-26 07:54:49,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5608214849921012 [2023-08-26 07:54:49,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1065 transitions. [2023-08-26 07:54:49,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1065 transitions. [2023-08-26 07:54:49,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:49,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1065 transitions. [2023-08-26 07:54:49,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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) [2023-08-26 07:54:49,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 633.0) internal successors, (2532), 4 states have internal predecessors, (2532), 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) [2023-08-26 07:54:49,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 633.0) internal successors, (2532), 4 states have internal predecessors, (2532), 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) [2023-08-26 07:54:49,873 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 360 flow. Second operand 3 states and 1065 transitions. [2023-08-26 07:54:49,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 186 transitions, 574 flow [2023-08-26 07:54:49,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 186 transitions, 570 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 07:54:49,875 INFO L231 Difference]: Finished difference. Result has 169 places, 167 transitions, 368 flow [2023-08-26 07:54:49,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=169, PETRI_TRANSITIONS=167} [2023-08-26 07:54:49,876 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 5 predicate places. [2023-08-26 07:54:49,876 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 368 flow [2023-08-26 07:54:49,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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) [2023-08-26 07:54:49,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:49,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:49,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 07:54:50,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 07:54:50,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:54:50,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1162858928, now seen corresponding path program 1 times [2023-08-26 07:54:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706017231] [2023-08-26 07:54:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:50,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:54:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706017231] [2023-08-26 07:54:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706017231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090848694] [2023-08-26 07:54:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:50,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:50,109 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:54:50,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 07:54:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:50,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:54:50,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:54:50,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:54:50,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090848694] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:50,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:54:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538094376] [2023-08-26 07:54:50,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:50,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:54:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:54:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:54:50,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 633 [2023-08-26 07:54:50,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 368 flow. Second operand has 7 states, 7 states have (on average 327.85714285714283) internal successors, (2295), 7 states have internal predecessors, (2295), 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) [2023-08-26 07:54:50,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:50,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 633 [2023-08-26 07:54:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:52,911 INFO L124 PetriNetUnfolderBase]: 17118/40578 cut-off events. [2023-08-26 07:54:52,911 INFO L125 PetriNetUnfolderBase]: For 940/956 co-relation queries the response was YES. [2023-08-26 07:54:52,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66231 conditions, 40578 events. 17118/40578 cut-off events. For 940/956 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 454594 event pairs, 15876 based on Foata normal form. 3/36348 useless extension candidates. Maximal degree in co-relation 66203. Up to 24740 conditions per place. [2023-08-26 07:54:53,066 INFO L140 encePairwiseOnDemand]: 630/633 looper letters, 66 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2023-08-26 07:54:53,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 522 flow [2023-08-26 07:54:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:54:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:54:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2029 transitions. [2023-08-26 07:54:53,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.534228541337546 [2023-08-26 07:54:53,069 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2029 transitions. [2023-08-26 07:54:53,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2029 transitions. [2023-08-26 07:54:53,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:53,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2029 transitions. [2023-08-26 07:54:53,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 338.1666666666667) internal successors, (2029), 6 states have internal predecessors, (2029), 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) [2023-08-26 07:54:53,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:54:53,075 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:54:53,075 INFO L175 Difference]: Start difference. First operand has 169 places, 167 transitions, 368 flow. Second operand 6 states and 2029 transitions. [2023-08-26 07:54:53,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 522 flow [2023-08-26 07:54:53,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 07:54:53,078 INFO L231 Difference]: Finished difference. Result has 176 places, 170 transitions, 402 flow [2023-08-26 07:54:53,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=176, PETRI_TRANSITIONS=170} [2023-08-26 07:54:53,078 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 12 predicate places. [2023-08-26 07:54:53,079 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 170 transitions, 402 flow [2023-08-26 07:54:53,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 327.85714285714283) internal successors, (2295), 7 states have internal predecessors, (2295), 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) [2023-08-26 07:54:53,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:53,079 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:53,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-26 07:54:53,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 07:54:53,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:54:53,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1394954853, now seen corresponding path program 2 times [2023-08-26 07:54:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750219554] [2023-08-26 07:54:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:54:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750219554] [2023-08-26 07:54:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750219554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328296076] [2023-08-26 07:54:53,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:54:53,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:53,334 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:54:53,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 07:54:53,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:54:53,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:54:53,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 07:54:53,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:53,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:54:53,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 07:54:53,463 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:54:53,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:54:53,480 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:54:53,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:54:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 07:54:53,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:54:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328296076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:54:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 07:54:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776308815] [2023-08-26 07:54:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:53,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:54:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:53,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:54:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:54:53,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 633 [2023-08-26 07:54:53,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 170 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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) [2023-08-26 07:54:53,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:53,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 633 [2023-08-26 07:54:53,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:22,283 INFO L124 PetriNetUnfolderBase]: 295206/452183 cut-off events. [2023-08-26 07:55:22,284 INFO L125 PetriNetUnfolderBase]: For 5447/5447 co-relation queries the response was YES. [2023-08-26 07:55:23,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900398 conditions, 452183 events. 295206/452183 cut-off events. For 5447/5447 co-relation queries the response was YES. Maximal size of possible extension queue 4844. Compared 3899659 event pairs, 157954 based on Foata normal form. 0/385833 useless extension candidates. Maximal degree in co-relation 900362. Up to 307342 conditions per place. [2023-08-26 07:55:24,688 INFO L140 encePairwiseOnDemand]: 596/633 looper letters, 493 selfloop transitions, 82 changer transitions 0/590 dead transitions. [2023-08-26 07:55:24,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 590 transitions, 2451 flow [2023-08-26 07:55:24,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:55:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:55:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1949 transitions. [2023-08-26 07:55:24,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131648235913638 [2023-08-26 07:55:24,691 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1949 transitions. [2023-08-26 07:55:24,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1949 transitions. [2023-08-26 07:55:24,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:24,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1949 transitions. [2023-08-26 07:55:24,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 324.8333333333333) internal successors, (1949), 6 states have internal predecessors, (1949), 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) [2023-08-26 07:55:24,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:55:24,697 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:55:24,698 INFO L175 Difference]: Start difference. First operand has 176 places, 170 transitions, 402 flow. Second operand 6 states and 1949 transitions. [2023-08-26 07:55:24,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 590 transitions, 2451 flow [2023-08-26 07:55:24,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 590 transitions, 2437 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:55:24,705 INFO L231 Difference]: Finished difference. Result has 185 places, 249 transitions, 942 flow [2023-08-26 07:55:24,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=185, PETRI_TRANSITIONS=249} [2023-08-26 07:55:24,705 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 21 predicate places. [2023-08-26 07:55:24,705 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 249 transitions, 942 flow [2023-08-26 07:55:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.33333333333334) internal successors, (1394), 6 states have internal predecessors, (1394), 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) [2023-08-26 07:55:24,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:24,706 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:24,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 07:55:24,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 07:55:24,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:55:24,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1394954456, now seen corresponding path program 1 times [2023-08-26 07:55:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797125491] [2023-08-26 07:55:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:55:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797125491] [2023-08-26 07:55:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797125491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100287497] [2023-08-26 07:55:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:24,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:24,968 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:55:24,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 07:55:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:25,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:55:25,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:55:25,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:55:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:55:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100287497] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:55:25,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:55:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 07:55:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227833140] [2023-08-26 07:55:25,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:55:25,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:55:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:55:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 07:55:25,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 633 [2023-08-26 07:55:25,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 249 transitions, 942 flow. Second operand has 13 states, 13 states have (on average 327.53846153846155) internal successors, (4258), 13 states have internal predecessors, (4258), 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) [2023-08-26 07:55:25,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:25,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 633 [2023-08-26 07:55:25,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:32,711 INFO L124 PetriNetUnfolderBase]: 43628/97564 cut-off events. [2023-08-26 07:55:32,711 INFO L125 PetriNetUnfolderBase]: For 18889/20463 co-relation queries the response was YES. [2023-08-26 07:55:33,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199794 conditions, 97564 events. 43628/97564 cut-off events. For 18889/20463 co-relation queries the response was YES. Maximal size of possible extension queue 2422. Compared 1148706 event pairs, 28548 based on Foata normal form. 313/88801 useless extension candidates. Maximal degree in co-relation 199736. Up to 50539 conditions per place. [2023-08-26 07:55:33,284 INFO L140 encePairwiseOnDemand]: 630/633 looper letters, 78 selfloop transitions, 11 changer transitions 0/255 dead transitions. [2023-08-26 07:55:33,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 255 transitions, 1156 flow [2023-08-26 07:55:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:55:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:55:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3994 transitions. [2023-08-26 07:55:33,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5258030542390731 [2023-08-26 07:55:33,288 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3994 transitions. [2023-08-26 07:55:33,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3994 transitions. [2023-08-26 07:55:33,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:33,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3994 transitions. [2023-08-26 07:55:33,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 332.8333333333333) internal successors, (3994), 12 states have internal predecessors, (3994), 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) [2023-08-26 07:55:33,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 633.0) internal successors, (8229), 13 states have internal predecessors, (8229), 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) [2023-08-26 07:55:33,299 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 633.0) internal successors, (8229), 13 states have internal predecessors, (8229), 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) [2023-08-26 07:55:33,299 INFO L175 Difference]: Start difference. First operand has 185 places, 249 transitions, 942 flow. Second operand 12 states and 3994 transitions. [2023-08-26 07:55:33,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 255 transitions, 1156 flow [2023-08-26 07:55:33,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 255 transitions, 1156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:55:33,824 INFO L231 Difference]: Finished difference. Result has 202 places, 255 transitions, 1026 flow [2023-08-26 07:55:33,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1026, PETRI_PLACES=202, PETRI_TRANSITIONS=255} [2023-08-26 07:55:33,824 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 38 predicate places. [2023-08-26 07:55:33,824 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 255 transitions, 1026 flow [2023-08-26 07:55:33,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 327.53846153846155) internal successors, (4258), 13 states have internal predecessors, (4258), 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) [2023-08-26 07:55:33,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:33,825 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:33,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 07:55:34,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:34,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:55:34,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1592015096, now seen corresponding path program 2 times [2023-08-26 07:55:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16338832] [2023-08-26 07:55:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:55:34,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:34,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16338832] [2023-08-26 07:55:34,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16338832] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:34,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:55:34,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:55:34,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993423675] [2023-08-26 07:55:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:34,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:55:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:34,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:55:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:55:34,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 633 [2023-08-26 07:55:34,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 255 transitions, 1026 flow. Second operand has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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) [2023-08-26 07:55:34,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:34,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 633 [2023-08-26 07:55:34,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:55,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:55,727 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2023-08-26 07:55:55,727 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-08-26 07:55:55,727 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-08-26 07:55:55,727 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-08-26 07:55:55,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [477#true, 170#L955-18true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:55,727 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,727 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,727 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,727 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), 124#L955-16true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:55,739 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:55,739 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,739 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:55,740 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:55,741 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:55,741 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:55:56,276 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,276 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,276 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,276 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,277 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [170#L955-18true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,278 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,278 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,278 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,278 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,279 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,279 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,279 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,279 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, 124#L955-16true, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,291 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,291 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,291 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,291 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,292 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, 124#L955-16true, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,292 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,292 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,292 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,292 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), 124#L955-16true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,293 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,293 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,293 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, 124#L955-16true, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,294 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,294 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,294 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [75#L944-48true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,296 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,296 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,296 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,296 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:55:56,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,636 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,636 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,636 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,636 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L955-18-->L955-19: Formula: (= (store |v_#race_18| |v_~#a~0.base_16| (store (select |v_#race_18| |v_~#a~0.base_16|) (+ |v_~#a~0.offset_15| (* |v_ULTIMATE.start_main_~i~2#1_16| 28) 3) |v_ULTIMATE.start_main_#t~nondet54#1_6|)) |v_#race_17|) InVars {#race=|v_#race_18|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} OutVars{#race=|v_#race_17|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} AuxVars[] AssignedVars[#race][258], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 266#L955-19true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,636 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,636 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,636 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,636 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [170#L955-18true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,637 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [477#true, 170#L955-18true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,637 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, 152#L944-41true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,637 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,637 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 95#L944-22true, 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,649 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, 95#L944-22true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,649 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,649 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,650 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,650 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [170#L955-18true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,650 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 95#L944-22true, 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,650 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,650 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 298#L955-17true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,651 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:55:56,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [75#L944-48true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,651 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [170#L955-18true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,651 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 298#L955-17true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,651 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,651 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,652 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,652 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,652 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [75#L944-48true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), 57#L944-18true, Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,653 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,653 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,653 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,653 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [75#L944-48true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, 124#L955-16true, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,663 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,663 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,663 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,663 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [75#L944-48true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 95#L944-22true, 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, 124#L955-16true, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,664 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1262] L955-16-->L955-17: Formula: (= (store |v_#race_14| |v_~#a~0.base_14| (store (select |v_#race_14| |v_~#a~0.base_14|) (+ |v_~#a~0.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_14| 28) 1) |v_ULTIMATE.start_main_#t~nondet54#1_4|)) |v_#race_13|) InVars {#race=|v_#race_14|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} OutVars{#race=|v_#race_13|, ~#a~0.base=|v_~#a~0.base_14|, ~#a~0.offset=|v_~#a~0.offset_13|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_14|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_4|} AuxVars[] AssignedVars[#race][226], [75#L944-48true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,664 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,664 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,665 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,665 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:55:56,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L955-18-->L955-19: Formula: (= (store |v_#race_18| |v_~#a~0.base_16| (store (select |v_#race_18| |v_~#a~0.base_16|) (+ |v_~#a~0.offset_15| (* |v_ULTIMATE.start_main_~i~2#1_16| 28) 3) |v_ULTIMATE.start_main_#t~nondet54#1_6|)) |v_#race_17|) InVars {#race=|v_#race_18|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} OutVars{#race=|v_#race_17|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} AuxVars[] AssignedVars[#race][258], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 658#true, 266#L955-19true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,955 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,955 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,955 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,955 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 144#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 388#true]) [2023-08-26 07:55:56,956 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L955-18-->L955-19: Formula: (= (store |v_#race_18| |v_~#a~0.base_16| (store (select |v_#race_18| |v_~#a~0.base_16|) (+ |v_~#a~0.offset_15| (* |v_ULTIMATE.start_main_~i~2#1_16| 28) 3) |v_ULTIMATE.start_main_#t~nondet54#1_6|)) |v_#race_17|) InVars {#race=|v_#race_18|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} OutVars{#race=|v_#race_17|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} AuxVars[] AssignedVars[#race][258], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 658#true, 108#L944-44true, 266#L955-19true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,956 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [75#L944-48true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,956 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,956 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, 108#L944-44true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, 95#L944-22true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,957 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,957 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,957 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,957 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [75#L944-48true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,968 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,968 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,968 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,968 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,968 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1402] L955-17-->L955-18: Formula: (= (store |v_#race_16| |v_~#a~0.base_15| (store (select |v_#race_16| |v_~#a~0.base_15|) (+ |v_~#a~0.offset_14| 2 (* |v_ULTIMATE.start_main_~i~2#1_15| 28)) |v_ULTIMATE.start_main_#t~nondet54#1_5|)) |v_#race_15|) InVars {#race=|v_#race_16|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} OutVars{#race=|v_#race_15|, ~#a~0.base=|v_~#a~0.base_15|, ~#a~0.offset=|v_~#a~0.offset_14|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_15|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_5|} AuxVars[] AssignedVars[#race][243], [75#L944-48true, 170#L955-18true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:56,968 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [75#L944-48true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 477#true, 298#L955-17true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, 95#L944-22true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:56,969 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:56,969 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:55:57,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1291] L955-18-->L955-19: Formula: (= (store |v_#race_18| |v_~#a~0.base_16| (store (select |v_#race_18| |v_~#a~0.base_16|) (+ |v_~#a~0.offset_15| (* |v_ULTIMATE.start_main_~i~2#1_16| 28) 3) |v_ULTIMATE.start_main_#t~nondet54#1_6|)) |v_#race_17|) InVars {#race=|v_#race_18|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} OutVars{#race=|v_#race_17|, ~#a~0.base=|v_~#a~0.base_16|, ~#a~0.offset=|v_~#a~0.offset_15|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_16|, ULTIMATE.start_main_#t~nondet54#1=|v_ULTIMATE.start_main_#t~nondet54#1_6|} AuxVars[] AssignedVars[#race][258], [75#L944-48true, 477#true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 658#true, 266#L955-19true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 279#L944-19true, 388#true]) [2023-08-26 07:55:57,445 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1798] L944-19-->L944-22: Formula: (let ((.cse0 (select |v_#race_289| |v_t_funThread2of2ForFork0_~p~0#1.base_107|))) (and (= (select .cse0 (+ 1 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)) |v_t_funThread2of2ForFork0_#t~nondet37#1_23|) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (= |v_t_funThread2of2ForFork0_#t~nondet37#1_23| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) InVars {#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|} OutVars{#race=|v_#race_289|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_107|, t_funThread2of2ForFork0_#t~nondet37#1=|v_t_funThread2of2ForFork0_#t~nondet37#1_23|, t_funThread2of2ForFork0_#t~post36#1=|v_t_funThread2of2ForFork0_#t~post36#1_15|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_107|, t_funThread2of2ForFork0_#t~mem35#1=|v_t_funThread2of2ForFork0_#t~mem35#1_15|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~post36#1, t_funThread2of2ForFork0_#t~mem35#1][313], [75#L944-48true, Black: 361#(<= |ULTIMATE.start_main_~i~3#1| 0), 170#L955-18true, 477#true, 658#true, Black: 638#(< |ULTIMATE.start_main_~i~1#1| 9), 542#true, Black: 634#(< |ULTIMATE.start_main_~i~1#1| 10), 95#L944-22true, Black: 650#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 642#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 548#(<= |ULTIMATE.start_main_~i~1#1| 4), Black: 646#(< |ULTIMATE.start_main_~i~1#1| 7), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 523#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 391#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 345#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 472#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 535#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 3 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), Black: 468#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 527#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0)), Black: 531#(and (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 1)) 0) (= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) (+ 2 |t_funThread1of2ForFork0_~p~0#1.offset|)) 0)), 388#true]) [2023-08-26 07:55:57,445 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:55:57,445 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:56:01,147 INFO L124 PetriNetUnfolderBase]: 186659/318731 cut-off events. [2023-08-26 07:56:01,147 INFO L125 PetriNetUnfolderBase]: For 113475/114557 co-relation queries the response was YES. [2023-08-26 07:56:02,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742177 conditions, 318731 events. 186659/318731 cut-off events. For 113475/114557 co-relation queries the response was YES. Maximal size of possible extension queue 5587. Compared 3246607 event pairs, 126863 based on Foata normal form. 0/285283 useless extension candidates. Maximal degree in co-relation 742094. Up to 236974 conditions per place. [2023-08-26 07:56:04,119 INFO L140 encePairwiseOnDemand]: 622/633 looper letters, 429 selfloop transitions, 25 changer transitions 11/535 dead transitions. [2023-08-26 07:56:04,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 535 transitions, 2825 flow [2023-08-26 07:56:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:56:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:56:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2991 transitions. [2023-08-26 07:56:04,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375987361769355 [2023-08-26 07:56:04,123 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2991 transitions. [2023-08-26 07:56:04,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2991 transitions. [2023-08-26 07:56:04,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:04,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2991 transitions. [2023-08-26 07:56:04,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 249.25) internal successors, (2991), 12 states have internal predecessors, (2991), 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) [2023-08-26 07:56:04,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 633.0) internal successors, (8229), 13 states have internal predecessors, (8229), 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) [2023-08-26 07:56:04,134 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 633.0) internal successors, (8229), 13 states have internal predecessors, (8229), 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) [2023-08-26 07:56:04,134 INFO L175 Difference]: Start difference. First operand has 202 places, 255 transitions, 1026 flow. Second operand 12 states and 2991 transitions. [2023-08-26 07:56:04,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 535 transitions, 2825 flow [2023-08-26 07:56:09,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 535 transitions, 2777 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:56:09,281 INFO L231 Difference]: Finished difference. Result has 214 places, 279 transitions, 1157 flow [2023-08-26 07:56:09,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1157, PETRI_PLACES=214, PETRI_TRANSITIONS=279} [2023-08-26 07:56:09,281 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 50 predicate places. [2023-08-26 07:56:09,281 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 279 transitions, 1157 flow [2023-08-26 07:56:09,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 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) [2023-08-26 07:56:09,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:09,282 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:09,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 07:56:09,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:09,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash 775902499, now seen corresponding path program 1 times [2023-08-26 07:56:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:09,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047828945] [2023-08-26 07:56:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047828945] [2023-08-26 07:56:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047828945] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226257721] [2023-08-26 07:56:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:09,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:09,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:56:09,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 07:56:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:09,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:56:09,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:09,437 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:09,449 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226257721] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:09,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 07:56:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334635299] [2023-08-26 07:56:09,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:09,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:56:09,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:56:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:56:09,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 633 [2023-08-26 07:56:09,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 279 transitions, 1157 flow. Second operand has 7 states, 7 states have (on average 328.57142857142856) internal successors, (2300), 7 states have internal predecessors, (2300), 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) [2023-08-26 07:56:09,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:09,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 633 [2023-08-26 07:56:09,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:10,172 INFO L124 PetriNetUnfolderBase]: 3715/9018 cut-off events. [2023-08-26 07:56:10,172 INFO L125 PetriNetUnfolderBase]: For 8728/8984 co-relation queries the response was YES. [2023-08-26 07:56:10,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22303 conditions, 9018 events. 3715/9018 cut-off events. For 8728/8984 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 78182 event pairs, 1263 based on Foata normal form. 751/9380 useless extension candidates. Maximal degree in co-relation 22237. Up to 3566 conditions per place. [2023-08-26 07:56:10,222 INFO L140 encePairwiseOnDemand]: 630/633 looper letters, 124 selfloop transitions, 6 changer transitions 0/237 dead transitions. [2023-08-26 07:56:10,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 237 transitions, 1223 flow [2023-08-26 07:56:10,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 07:56:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 07:56:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1731 transitions. [2023-08-26 07:56:10,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469194312796208 [2023-08-26 07:56:10,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1731 transitions. [2023-08-26 07:56:10,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1731 transitions. [2023-08-26 07:56:10,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:10,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1731 transitions. [2023-08-26 07:56:10,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 346.2) internal successors, (1731), 5 states have internal predecessors, (1731), 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) [2023-08-26 07:56:10,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 633.0) internal successors, (3798), 6 states have internal predecessors, (3798), 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) [2023-08-26 07:56:10,228 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 633.0) internal successors, (3798), 6 states have internal predecessors, (3798), 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) [2023-08-26 07:56:10,228 INFO L175 Difference]: Start difference. First operand has 214 places, 279 transitions, 1157 flow. Second operand 5 states and 1731 transitions. [2023-08-26 07:56:10,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 237 transitions, 1223 flow [2023-08-26 07:56:10,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 237 transitions, 1217 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 07:56:10,247 INFO L231 Difference]: Finished difference. Result has 157 places, 179 transitions, 783 flow [2023-08-26 07:56:10,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=783, PETRI_PLACES=157, PETRI_TRANSITIONS=179} [2023-08-26 07:56:10,247 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -7 predicate places. [2023-08-26 07:56:10,247 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 179 transitions, 783 flow [2023-08-26 07:56:10,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 328.57142857142856) internal successors, (2300), 7 states have internal predecessors, (2300), 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) [2023-08-26 07:56:10,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:10,248 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:10,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 07:56:10,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-26 07:56:10,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:10,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash 861602459, now seen corresponding path program 1 times [2023-08-26 07:56:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280339704] [2023-08-26 07:56:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:10,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280339704] [2023-08-26 07:56:10,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280339704] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:10,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015719761] [2023-08-26 07:56:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:10,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:10,830 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:56:10,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 07:56:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:10,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 07:56:10,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:10,960 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:56:11,007 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:11,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:56:11,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:11,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:11,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-08-26 07:56:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:11,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:15,107 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_968) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 07:56:17,122 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_968 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_968) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 07:56:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 07:56:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015719761] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:17,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:17,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-08-26 07:56:17,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837501804] [2023-08-26 07:56:17,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:17,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 07:56:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 07:56:17,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=142, Unknown=4, NotChecked=50, Total=240 [2023-08-26 07:56:17,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 633 [2023-08-26 07:56:17,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 179 transitions, 783 flow. Second operand has 16 states, 16 states have (on average 201.375) internal successors, (3222), 16 states have internal predecessors, (3222), 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) [2023-08-26 07:56:17,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:17,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 633 [2023-08-26 07:56:17,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:18,782 INFO L124 PetriNetUnfolderBase]: 8673/17151 cut-off events. [2023-08-26 07:56:18,782 INFO L125 PetriNetUnfolderBase]: For 23061/23123 co-relation queries the response was YES. [2023-08-26 07:56:18,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48558 conditions, 17151 events. 8673/17151 cut-off events. For 23061/23123 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 138507 event pairs, 2158 based on Foata normal form. 96/16566 useless extension candidates. Maximal degree in co-relation 48492. Up to 8924 conditions per place. [2023-08-26 07:56:18,865 INFO L140 encePairwiseOnDemand]: 625/633 looper letters, 181 selfloop transitions, 22 changer transitions 3/269 dead transitions. [2023-08-26 07:56:18,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 269 transitions, 1513 flow [2023-08-26 07:56:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:56:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:56:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1554 transitions. [2023-08-26 07:56:18,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35071090047393366 [2023-08-26 07:56:18,867 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1554 transitions. [2023-08-26 07:56:18,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1554 transitions. [2023-08-26 07:56:18,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:18,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1554 transitions. [2023-08-26 07:56:18,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 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) [2023-08-26 07:56:18,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 633.0) internal successors, (5064), 8 states have internal predecessors, (5064), 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) [2023-08-26 07:56:18,871 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 633.0) internal successors, (5064), 8 states have internal predecessors, (5064), 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) [2023-08-26 07:56:18,871 INFO L175 Difference]: Start difference. First operand has 157 places, 179 transitions, 783 flow. Second operand 7 states and 1554 transitions. [2023-08-26 07:56:18,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 269 transitions, 1513 flow [2023-08-26 07:56:18,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 269 transitions, 1492 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 07:56:18,919 INFO L231 Difference]: Finished difference. Result has 164 places, 189 transitions, 909 flow [2023-08-26 07:56:18,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=909, PETRI_PLACES=164, PETRI_TRANSITIONS=189} [2023-08-26 07:56:18,919 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 0 predicate places. [2023-08-26 07:56:18,919 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 189 transitions, 909 flow [2023-08-26 07:56:18,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 201.375) internal successors, (3222), 16 states have internal predecessors, (3222), 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) [2023-08-26 07:56:18,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:18,920 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:18,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 07:56:19,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:19,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:19,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1117975021, now seen corresponding path program 1 times [2023-08-26 07:56:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859131727] [2023-08-26 07:56:19,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 07:56:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:19,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859131727] [2023-08-26 07:56:19,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859131727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:56:19,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:56:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:56:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607878527] [2023-08-26 07:56:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:56:19,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:56:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:19,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:56:19,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:56:19,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 633 [2023-08-26 07:56:19,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 189 transitions, 909 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 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) [2023-08-26 07:56:19,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:19,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 633 [2023-08-26 07:56:19,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:21,848 INFO L124 PetriNetUnfolderBase]: 15940/26550 cut-off events. [2023-08-26 07:56:21,848 INFO L125 PetriNetUnfolderBase]: For 37771/37785 co-relation queries the response was YES. [2023-08-26 07:56:21,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80479 conditions, 26550 events. 15940/26550 cut-off events. For 37771/37785 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 189644 event pairs, 6868 based on Foata normal form. 0/24881 useless extension candidates. Maximal degree in co-relation 80409. Up to 16870 conditions per place. [2023-08-26 07:56:21,989 INFO L140 encePairwiseOnDemand]: 604/633 looper letters, 407 selfloop transitions, 66 changer transitions 0/488 dead transitions. [2023-08-26 07:56:21,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 488 transitions, 3323 flow [2023-08-26 07:56:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:56:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:56:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1675 transitions. [2023-08-26 07:56:21,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410215903106898 [2023-08-26 07:56:21,991 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1675 transitions. [2023-08-26 07:56:21,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1675 transitions. [2023-08-26 07:56:21,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:21,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1675 transitions. [2023-08-26 07:56:21,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 279.1666666666667) internal successors, (1675), 6 states have internal predecessors, (1675), 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) [2023-08-26 07:56:21,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:56:21,995 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:56:21,995 INFO L175 Difference]: Start difference. First operand has 164 places, 189 transitions, 909 flow. Second operand 6 states and 1675 transitions. [2023-08-26 07:56:21,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 488 transitions, 3323 flow [2023-08-26 07:56:22,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 488 transitions, 3308 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-26 07:56:22,054 INFO L231 Difference]: Finished difference. Result has 172 places, 252 transitions, 1448 flow [2023-08-26 07:56:22,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1448, PETRI_PLACES=172, PETRI_TRANSITIONS=252} [2023-08-26 07:56:22,055 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 8 predicate places. [2023-08-26 07:56:22,055 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 252 transitions, 1448 flow [2023-08-26 07:56:22,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 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) [2023-08-26 07:56:22,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:22,055 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:22,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 07:56:22,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:22,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1117974728, now seen corresponding path program 1 times [2023-08-26 07:56:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461620464] [2023-08-26 07:56:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:56:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461620464] [2023-08-26 07:56:22,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461620464] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:22,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943951004] [2023-08-26 07:56:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:22,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:22,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:22,224 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:56:22,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-26 07:56:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:22,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 07:56:22,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:22,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:56:22,387 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:22,387 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:56:22,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:22,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:22,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-08-26 07:56:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:56:22,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:34,502 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1088 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1088) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 07:56:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 07:56:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943951004] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:34,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:34,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-08-26 07:56:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725598732] [2023-08-26 07:56:34,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:34,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 07:56:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:34,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 07:56:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=159, Unknown=5, NotChecked=26, Total=240 [2023-08-26 07:56:34,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 633 [2023-08-26 07:56:34,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 252 transitions, 1448 flow. Second operand has 16 states, 16 states have (on average 207.5625) internal successors, (3321), 16 states have internal predecessors, (3321), 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) [2023-08-26 07:56:34,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:34,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 633 [2023-08-26 07:56:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:36,687 INFO L124 PetriNetUnfolderBase]: 10653/19841 cut-off events. [2023-08-26 07:56:36,687 INFO L125 PetriNetUnfolderBase]: For 31433/31916 co-relation queries the response was YES. [2023-08-26 07:56:36,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63797 conditions, 19841 events. 10653/19841 cut-off events. For 31433/31916 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 156561 event pairs, 1658 based on Foata normal form. 160/19034 useless extension candidates. Maximal degree in co-relation 63724. Up to 13631 conditions per place. [2023-08-26 07:56:36,802 INFO L140 encePairwiseOnDemand]: 625/633 looper letters, 239 selfloop transitions, 15 changer transitions 7/335 dead transitions. [2023-08-26 07:56:36,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 335 transitions, 2347 flow [2023-08-26 07:56:36,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:56:36,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:56:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1589 transitions. [2023-08-26 07:56:36,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.358609794628752 [2023-08-26 07:56:36,804 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1589 transitions. [2023-08-26 07:56:36,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1589 transitions. [2023-08-26 07:56:36,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:36,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1589 transitions. [2023-08-26 07:56:36,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 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) [2023-08-26 07:56:36,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 633.0) internal successors, (5064), 8 states have internal predecessors, (5064), 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) [2023-08-26 07:56:36,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 633.0) internal successors, (5064), 8 states have internal predecessors, (5064), 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) [2023-08-26 07:56:36,808 INFO L175 Difference]: Start difference. First operand has 172 places, 252 transitions, 1448 flow. Second operand 7 states and 1589 transitions. [2023-08-26 07:56:36,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 335 transitions, 2347 flow [2023-08-26 07:56:36,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 335 transitions, 2347 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:56:36,873 INFO L231 Difference]: Finished difference. Result has 182 places, 259 transitions, 1542 flow [2023-08-26 07:56:36,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1542, PETRI_PLACES=182, PETRI_TRANSITIONS=259} [2023-08-26 07:56:36,873 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 18 predicate places. [2023-08-26 07:56:36,873 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 259 transitions, 1542 flow [2023-08-26 07:56:36,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 207.5625) internal successors, (3321), 16 states have internal predecessors, (3321), 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) [2023-08-26 07:56:36,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:36,874 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:36,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-26 07:56:37,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:37,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:37,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash -997858891, now seen corresponding path program 1 times [2023-08-26 07:56:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076391209] [2023-08-26 07:56:37,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:37,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:37,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076391209] [2023-08-26 07:56:37,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076391209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:56:37,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:56:37,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:56:37,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887343288] [2023-08-26 07:56:37,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:56:37,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:56:37,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:37,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:56:37,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:56:37,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 633 [2023-08-26 07:56:37,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 259 transitions, 1542 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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) [2023-08-26 07:56:37,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:37,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 633 [2023-08-26 07:56:37,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:40,675 INFO L124 PetriNetUnfolderBase]: 18881/31295 cut-off events. [2023-08-26 07:56:40,676 INFO L125 PetriNetUnfolderBase]: For 51767/51769 co-relation queries the response was YES. [2023-08-26 07:56:40,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106651 conditions, 31295 events. 18881/31295 cut-off events. For 51767/51769 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 226314 event pairs, 12113 based on Foata normal form. 0/29861 useless extension candidates. Maximal degree in co-relation 106572. Up to 28278 conditions per place. [2023-08-26 07:56:40,881 INFO L140 encePairwiseOnDemand]: 606/633 looper letters, 357 selfloop transitions, 115 changer transitions 0/481 dead transitions. [2023-08-26 07:56:40,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 481 transitions, 3475 flow [2023-08-26 07:56:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:56:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:56:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1654 transitions. [2023-08-26 07:56:40,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43549236440231703 [2023-08-26 07:56:40,882 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1654 transitions. [2023-08-26 07:56:40,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1654 transitions. [2023-08-26 07:56:40,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:40,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1654 transitions. [2023-08-26 07:56:40,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.6666666666667) internal successors, (1654), 6 states have internal predecessors, (1654), 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) [2023-08-26 07:56:40,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:56:40,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:56:40,886 INFO L175 Difference]: Start difference. First operand has 182 places, 259 transitions, 1542 flow. Second operand 6 states and 1654 transitions. [2023-08-26 07:56:40,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 481 transitions, 3475 flow [2023-08-26 07:56:41,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 481 transitions, 3473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 07:56:41,046 INFO L231 Difference]: Finished difference. Result has 191 places, 364 transitions, 2592 flow [2023-08-26 07:56:41,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2592, PETRI_PLACES=191, PETRI_TRANSITIONS=364} [2023-08-26 07:56:41,046 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 27 predicate places. [2023-08-26 07:56:41,046 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 364 transitions, 2592 flow [2023-08-26 07:56:41,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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) [2023-08-26 07:56:41,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:41,047 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:41,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 07:56:41,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:41,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1513716273, now seen corresponding path program 1 times [2023-08-26 07:56:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609080010] [2023-08-26 07:56:41,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-26 07:56:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609080010] [2023-08-26 07:56:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609080010] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:56:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:56:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:56:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83564114] [2023-08-26 07:56:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:56:41,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:56:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:56:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:56:41,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 633 [2023-08-26 07:56:41,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 364 transitions, 2592 flow. Second operand has 6 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 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) [2023-08-26 07:56:41,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:41,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 633 [2023-08-26 07:56:41,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:45,201 INFO L124 PetriNetUnfolderBase]: 19432/32328 cut-off events. [2023-08-26 07:56:45,202 INFO L125 PetriNetUnfolderBase]: For 63591/63599 co-relation queries the response was YES. [2023-08-26 07:56:45,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118975 conditions, 32328 events. 19432/32328 cut-off events. For 63591/63599 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 237602 event pairs, 11740 based on Foata normal form. 0/31118 useless extension candidates. Maximal degree in co-relation 118892. Up to 28893 conditions per place. [2023-08-26 07:56:45,419 INFO L140 encePairwiseOnDemand]: 606/633 looper letters, 450 selfloop transitions, 129 changer transitions 0/594 dead transitions. [2023-08-26 07:56:45,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 594 transitions, 4955 flow [2023-08-26 07:56:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:56:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:56:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1647 transitions. [2023-08-26 07:56:45,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43364928909952605 [2023-08-26 07:56:45,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1647 transitions. [2023-08-26 07:56:45,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1647 transitions. [2023-08-26 07:56:45,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:45,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1647 transitions. [2023-08-26 07:56:45,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 274.5) internal successors, (1647), 6 states have internal predecessors, (1647), 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) [2023-08-26 07:56:45,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:56:45,424 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:56:45,424 INFO L175 Difference]: Start difference. First operand has 191 places, 364 transitions, 2592 flow. Second operand 6 states and 1647 transitions. [2023-08-26 07:56:45,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 594 transitions, 4955 flow [2023-08-26 07:56:45,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 594 transitions, 4815 flow, removed 70 selfloop flow, removed 0 redundant places. [2023-08-26 07:56:45,656 INFO L231 Difference]: Finished difference. Result has 201 places, 475 transitions, 3682 flow [2023-08-26 07:56:45,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=2458, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3682, PETRI_PLACES=201, PETRI_TRANSITIONS=475} [2023-08-26 07:56:45,656 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 37 predicate places. [2023-08-26 07:56:45,656 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 475 transitions, 3682 flow [2023-08-26 07:56:45,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 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) [2023-08-26 07:56:45,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:45,657 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:56:45,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 07:56:45,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:45,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1825647706, now seen corresponding path program 1 times [2023-08-26 07:56:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832507187] [2023-08-26 07:56:45,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:45,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:45,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832507187] [2023-08-26 07:56:45,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832507187] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:56:45,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:56:45,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 07:56:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716452261] [2023-08-26 07:56:45,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:56:45,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 07:56:45,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:45,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 07:56:45,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:56:45,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 633 [2023-08-26 07:56:45,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 475 transitions, 3682 flow. Second operand has 5 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 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) [2023-08-26 07:56:45,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:45,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 633 [2023-08-26 07:56:45,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:46,358 INFO L124 PetriNetUnfolderBase]: 1319/3754 cut-off events. [2023-08-26 07:56:46,359 INFO L125 PetriNetUnfolderBase]: For 6574/6581 co-relation queries the response was YES. [2023-08-26 07:56:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12771 conditions, 3754 events. 1319/3754 cut-off events. For 6574/6581 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 27932 event pairs, 374 based on Foata normal form. 219/3832 useless extension candidates. Maximal degree in co-relation 12683. Up to 1378 conditions per place. [2023-08-26 07:56:46,377 INFO L140 encePairwiseOnDemand]: 618/633 looper letters, 101 selfloop transitions, 15 changer transitions 11/184 dead transitions. [2023-08-26 07:56:46,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 184 transitions, 1371 flow [2023-08-26 07:56:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 07:56:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 07:56:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1144 transitions. [2023-08-26 07:56:46,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4518167456556082 [2023-08-26 07:56:46,381 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1144 transitions. [2023-08-26 07:56:46,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1144 transitions. [2023-08-26 07:56:46,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:46,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1144 transitions. [2023-08-26 07:56:46,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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) [2023-08-26 07:56:46,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 633.0) internal successors, (3165), 5 states have internal predecessors, (3165), 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) [2023-08-26 07:56:46,383 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 633.0) internal successors, (3165), 5 states have internal predecessors, (3165), 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) [2023-08-26 07:56:46,384 INFO L175 Difference]: Start difference. First operand has 201 places, 475 transitions, 3682 flow. Second operand 4 states and 1144 transitions. [2023-08-26 07:56:46,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 184 transitions, 1371 flow [2023-08-26 07:56:46,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 184 transitions, 1042 flow, removed 85 selfloop flow, removed 37 redundant places. [2023-08-26 07:56:46,405 INFO L231 Difference]: Finished difference. Result has 158 places, 141 transitions, 654 flow [2023-08-26 07:56:46,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=654, PETRI_PLACES=158, PETRI_TRANSITIONS=141} [2023-08-26 07:56:46,406 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -6 predicate places. [2023-08-26 07:56:46,406 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 141 transitions, 654 flow [2023-08-26 07:56:46,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 267.4) internal successors, (1337), 5 states have internal predecessors, (1337), 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) [2023-08-26 07:56:46,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:46,406 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:56:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-26 07:56:46,406 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:46,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1332075487, now seen corresponding path program 1 times [2023-08-26 07:56:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:46,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573755298] [2023-08-26 07:56:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573755298] [2023-08-26 07:56:46,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573755298] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:46,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082603458] [2023-08-26 07:56:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:46,805 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:56:46,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-26 07:56:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:46,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 07:56:46,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:46,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:56:47,014 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:47,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:56:47,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:47,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:56:47,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:56:47,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:56:47,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:56:47,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:56:47,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:56:47,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:56:47,309 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:47,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:56:47,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:56:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:47,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:47,546 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:56:47,547 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 07:56:47,555 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:56:47,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 07:56:47,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 07:56:47,613 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1370 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_135| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_129| Int) (v_ArrVal_1372 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_129| v_ArrVal_1370)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1372) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_135|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_129| |v_t_funThread2of2ForFork0_~p~0#1.offset_135|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1370 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_135| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_129| Int) (v_ArrVal_1372 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_129| v_ArrVal_1370)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1372) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_135|) 0))))) is different from false [2023-08-26 07:56:47,632 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1370 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_135| Int) (v_ArrVal_1365 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_129| Int) (v_ArrVal_1372 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1365))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_129| v_ArrVal_1370))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1372) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_135|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1370 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_135| Int) (v_ArrVal_1365 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_129| Int) (v_ArrVal_1372 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_129| |v_t_funThread2of2ForFork0_~p~0#1.offset_135|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1365))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_129| v_ArrVal_1370))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1372) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_135|) 0)))) is different from false [2023-08-26 07:56:55,718 WARN L234 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:56:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 07:56:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082603458] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:55,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2023-08-26 07:56:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245232751] [2023-08-26 07:56:55,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:55,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-26 07:56:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:55,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-26 07:56:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=380, Unknown=9, NotChecked=86, Total=600 [2023-08-26 07:56:55,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 633 [2023-08-26 07:56:55,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 141 transitions, 654 flow. Second operand has 25 states, 25 states have (on average 176.44) internal successors, (4411), 25 states have internal predecessors, (4411), 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) [2023-08-26 07:56:55,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:55,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 633 [2023-08-26 07:56:55,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:57,645 INFO L124 PetriNetUnfolderBase]: 3739/7247 cut-off events. [2023-08-26 07:56:57,645 INFO L125 PetriNetUnfolderBase]: For 10923/10949 co-relation queries the response was YES. [2023-08-26 07:56:57,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22883 conditions, 7247 events. 3739/7247 cut-off events. For 10923/10949 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 48566 event pairs, 193 based on Foata normal form. 16/6843 useless extension candidates. Maximal degree in co-relation 22813. Up to 2876 conditions per place. [2023-08-26 07:56:57,676 INFO L140 encePairwiseOnDemand]: 620/633 looper letters, 321 selfloop transitions, 46 changer transitions 43/416 dead transitions. [2023-08-26 07:56:57,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 416 transitions, 2523 flow [2023-08-26 07:56:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-26 07:56:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-26 07:56:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3480 transitions. [2023-08-26 07:56:57,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3054239073196419 [2023-08-26 07:56:57,680 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3480 transitions. [2023-08-26 07:56:57,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3480 transitions. [2023-08-26 07:56:57,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:57,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3480 transitions. [2023-08-26 07:56:57,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 193.33333333333334) internal successors, (3480), 18 states have internal predecessors, (3480), 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) [2023-08-26 07:56:57,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 633.0) internal successors, (12027), 19 states have internal predecessors, (12027), 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) [2023-08-26 07:56:57,689 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 633.0) internal successors, (12027), 19 states have internal predecessors, (12027), 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) [2023-08-26 07:56:57,689 INFO L175 Difference]: Start difference. First operand has 158 places, 141 transitions, 654 flow. Second operand 18 states and 3480 transitions. [2023-08-26 07:56:57,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 416 transitions, 2523 flow [2023-08-26 07:56:57,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 416 transitions, 2474 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 07:56:57,703 INFO L231 Difference]: Finished difference. Result has 179 places, 173 transitions, 958 flow [2023-08-26 07:56:57,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=958, PETRI_PLACES=179, PETRI_TRANSITIONS=173} [2023-08-26 07:56:57,703 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 15 predicate places. [2023-08-26 07:56:57,703 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 173 transitions, 958 flow [2023-08-26 07:56:57,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 176.44) internal successors, (4411), 25 states have internal predecessors, (4411), 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) [2023-08-26 07:56:57,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:57,704 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:56:57,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-26 07:56:57,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-26 07:56:57,908 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:56:57,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -837538874, now seen corresponding path program 1 times [2023-08-26 07:56:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383086401] [2023-08-26 07:56:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:58,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383086401] [2023-08-26 07:56:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383086401] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732870479] [2023-08-26 07:56:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:58,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:58,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:58,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:56:58,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-26 07:56:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:58,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 07:56:58,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:58,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:56:58,422 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:58,422 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:56:58,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:58,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:56:58,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:58,517 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:58,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:56:58,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:56:58,621 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:56:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:58,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:58,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 07:56:58,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 07:56:58,756 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_131| Int) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1505 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_137| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1503) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_137| v_ArrVal_1505) |v_t_funThread1of2ForFork0_~p~0#1.offset_131|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_131| |v_t_funThread2of2ForFork0_~p~0#1.offset_137|))) is different from false [2023-08-26 07:56:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 07:56:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732870479] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:58,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2023-08-26 07:56:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648885141] [2023-08-26 07:56:58,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:58,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-26 07:56:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-26 07:56:58,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=313, Unknown=3, NotChecked=36, Total=420 [2023-08-26 07:56:58,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 633 [2023-08-26 07:56:58,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 173 transitions, 958 flow. Second operand has 21 states, 21 states have (on average 177.1904761904762) internal successors, (3721), 21 states have internal predecessors, (3721), 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) [2023-08-26 07:56:58,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:58,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 633 [2023-08-26 07:56:58,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:00,735 INFO L124 PetriNetUnfolderBase]: 5109/9810 cut-off events. [2023-08-26 07:57:00,735 INFO L125 PetriNetUnfolderBase]: For 29997/30041 co-relation queries the response was YES. [2023-08-26 07:57:00,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35463 conditions, 9810 events. 5109/9810 cut-off events. For 29997/30041 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 69346 event pairs, 735 based on Foata normal form. 18/9204 useless extension candidates. Maximal degree in co-relation 35385. Up to 5132 conditions per place. [2023-08-26 07:57:00,786 INFO L140 encePairwiseOnDemand]: 618/633 looper letters, 343 selfloop transitions, 53 changer transitions 60/462 dead transitions. [2023-08-26 07:57:00,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 462 transitions, 3115 flow [2023-08-26 07:57:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-26 07:57:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-26 07:57:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3495 transitions. [2023-08-26 07:57:00,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3067403896787783 [2023-08-26 07:57:00,789 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3495 transitions. [2023-08-26 07:57:00,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3495 transitions. [2023-08-26 07:57:00,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:00,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3495 transitions. [2023-08-26 07:57:00,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 194.16666666666666) internal successors, (3495), 18 states have internal predecessors, (3495), 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) [2023-08-26 07:57:00,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 633.0) internal successors, (12027), 19 states have internal predecessors, (12027), 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) [2023-08-26 07:57:00,799 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 633.0) internal successors, (12027), 19 states have internal predecessors, (12027), 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) [2023-08-26 07:57:00,799 INFO L175 Difference]: Start difference. First operand has 179 places, 173 transitions, 958 flow. Second operand 18 states and 3495 transitions. [2023-08-26 07:57:00,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 462 transitions, 3115 flow [2023-08-26 07:57:00,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 462 transitions, 3035 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-08-26 07:57:00,857 INFO L231 Difference]: Finished difference. Result has 197 places, 202 transitions, 1338 flow [2023-08-26 07:57:00,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1338, PETRI_PLACES=197, PETRI_TRANSITIONS=202} [2023-08-26 07:57:00,858 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 33 predicate places. [2023-08-26 07:57:00,858 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 202 transitions, 1338 flow [2023-08-26 07:57:00,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 177.1904761904762) internal successors, (3721), 21 states have internal predecessors, (3721), 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) [2023-08-26 07:57:00,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:00,859 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:57:00,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-26 07:57:01,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-26 07:57:01,062 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:57:01,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 435689409, now seen corresponding path program 2 times [2023-08-26 07:57:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523159620] [2023-08-26 07:57:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:01,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:57:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523159620] [2023-08-26 07:57:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523159620] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545542232] [2023-08-26 07:57:01,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:57:01,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:01,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:01,439 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:57:01,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-26 07:57:01,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:57:01,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:57:01,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-26 07:57:01,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:01,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:57:01,801 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:01,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:57:01,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:57:01,843 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:57:01,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:57:01,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:57:01,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:57:01,995 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:01,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:57:02,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:57:02,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:57:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:57:02,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:02,216 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1639 Int) (v_ArrVal_1636 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_139| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1636) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_139|)) 0)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1637))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1639))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_139|) 0))) is different from false [2023-08-26 07:57:02,230 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:57:02,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 07:57:02,237 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:57:02,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 07:57:02,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 07:57:02,258 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1639 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_133| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_139| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_133| |v_t_funThread2of2ForFork0_~p~0#1.offset_139|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1637) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_133| v_ArrVal_1639) |v_t_funThread2of2ForFork0_~p~0#1.offset_139|) 0))) (or (forall ((v_ArrVal_1637 (Array Int Int)) (v_ArrVal_1639 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_133| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_139| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1637) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_133| v_ArrVal_1639) |v_t_funThread2of2ForFork0_~p~0#1.offset_139|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-26 07:57:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-26 07:57:06,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545542232] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:06,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2023-08-26 07:57:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601501906] [2023-08-26 07:57:06,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:06,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 07:57:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 07:57:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=389, Unknown=5, NotChecked=82, Total=552 [2023-08-26 07:57:06,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 633 [2023-08-26 07:57:06,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 202 transitions, 1338 flow. Second operand has 24 states, 24 states have (on average 174.58333333333334) internal successors, (4190), 24 states have internal predecessors, (4190), 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) [2023-08-26 07:57:06,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:06,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 633 [2023-08-26 07:57:06,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:13,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:57:15,622 INFO L124 PetriNetUnfolderBase]: 6362/12520 cut-off events. [2023-08-26 07:57:15,622 INFO L125 PetriNetUnfolderBase]: For 88922/88960 co-relation queries the response was YES. [2023-08-26 07:57:15,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52514 conditions, 12520 events. 6362/12520 cut-off events. For 88922/88960 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 96038 event pairs, 785 based on Foata normal form. 27/11725 useless extension candidates. Maximal degree in co-relation 52427. Up to 6169 conditions per place. [2023-08-26 07:57:15,807 INFO L140 encePairwiseOnDemand]: 617/633 looper letters, 450 selfloop transitions, 90 changer transitions 30/576 dead transitions. [2023-08-26 07:57:15,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 576 transitions, 4359 flow [2023-08-26 07:57:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-26 07:57:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-26 07:57:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5594 transitions. [2023-08-26 07:57:15,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29457609268035806 [2023-08-26 07:57:15,812 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5594 transitions. [2023-08-26 07:57:15,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5594 transitions. [2023-08-26 07:57:15,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:15,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5594 transitions. [2023-08-26 07:57:15,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 186.46666666666667) internal successors, (5594), 30 states have internal predecessors, (5594), 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) [2023-08-26 07:57:15,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 633.0) internal successors, (19623), 31 states have internal predecessors, (19623), 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) [2023-08-26 07:57:15,828 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 633.0) internal successors, (19623), 31 states have internal predecessors, (19623), 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) [2023-08-26 07:57:15,828 INFO L175 Difference]: Start difference. First operand has 197 places, 202 transitions, 1338 flow. Second operand 30 states and 5594 transitions. [2023-08-26 07:57:15,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 576 transitions, 4359 flow [2023-08-26 07:57:15,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 576 transitions, 4183 flow, removed 59 selfloop flow, removed 5 redundant places. [2023-08-26 07:57:15,938 INFO L231 Difference]: Finished difference. Result has 233 places, 254 transitions, 2009 flow [2023-08-26 07:57:15,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2009, PETRI_PLACES=233, PETRI_TRANSITIONS=254} [2023-08-26 07:57:15,939 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 69 predicate places. [2023-08-26 07:57:15,939 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 254 transitions, 2009 flow [2023-08-26 07:57:15,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 174.58333333333334) internal successors, (4190), 24 states have internal predecessors, (4190), 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) [2023-08-26 07:57:15,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:15,940 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:57:15,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-26 07:57:16,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:16,145 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:57:16,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:16,145 INFO L85 PathProgramCache]: Analyzing trace with hash -836497059, now seen corresponding path program 1 times [2023-08-26 07:57:16,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:16,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615135073] [2023-08-26 07:57:16,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:57:16,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:16,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615135073] [2023-08-26 07:57:16,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615135073] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:57:16,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:57:16,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:57:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478519334] [2023-08-26 07:57:16,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:57:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:57:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:57:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:57:16,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 633 [2023-08-26 07:57:16,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 254 transitions, 2009 flow. Second operand has 6 states, 6 states have (on average 233.66666666666666) internal successors, (1402), 6 states have internal predecessors, (1402), 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) [2023-08-26 07:57:16,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:16,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 633 [2023-08-26 07:57:16,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:17,896 INFO L124 PetriNetUnfolderBase]: 5993/11836 cut-off events. [2023-08-26 07:57:17,896 INFO L125 PetriNetUnfolderBase]: For 267619/267697 co-relation queries the response was YES. [2023-08-26 07:57:17,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62898 conditions, 11836 events. 5993/11836 cut-off events. For 267619/267697 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 89897 event pairs, 4489 based on Foata normal form. 0/11113 useless extension candidates. Maximal degree in co-relation 62796. Up to 10463 conditions per place. [2023-08-26 07:57:17,960 INFO L140 encePairwiseOnDemand]: 627/633 looper letters, 223 selfloop transitions, 5 changer transitions 60/297 dead transitions. [2023-08-26 07:57:17,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 297 transitions, 3119 flow [2023-08-26 07:57:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:57:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:57:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2023-08-26 07:57:17,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3907319641916798 [2023-08-26 07:57:17,962 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1484 transitions. [2023-08-26 07:57:17,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1484 transitions. [2023-08-26 07:57:17,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:17,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1484 transitions. [2023-08-26 07:57:17,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.33333333333334) internal successors, (1484), 6 states have internal predecessors, (1484), 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) [2023-08-26 07:57:17,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:57:17,966 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 633.0) internal successors, (4431), 7 states have internal predecessors, (4431), 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) [2023-08-26 07:57:17,966 INFO L175 Difference]: Start difference. First operand has 233 places, 254 transitions, 2009 flow. Second operand 6 states and 1484 transitions. [2023-08-26 07:57:17,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 297 transitions, 3119 flow [2023-08-26 07:57:18,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 297 transitions, 2719 flow, removed 175 selfloop flow, removed 8 redundant places. [2023-08-26 07:57:18,352 INFO L231 Difference]: Finished difference. Result has 228 places, 201 transitions, 1293 flow [2023-08-26 07:57:18,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1743, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1293, PETRI_PLACES=228, PETRI_TRANSITIONS=201} [2023-08-26 07:57:18,352 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 64 predicate places. [2023-08-26 07:57:18,352 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 201 transitions, 1293 flow [2023-08-26 07:57:18,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.66666666666666) internal successors, (1402), 6 states have internal predecessors, (1402), 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) [2023-08-26 07:57:18,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:18,353 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:57:18,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-26 07:57:18,353 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:57:18,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1392901966, now seen corresponding path program 2 times [2023-08-26 07:57:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514120762] [2023-08-26 07:57:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:57:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514120762] [2023-08-26 07:57:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514120762] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853266725] [2023-08-26 07:57:18,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:57:18,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:18,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:18,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:57:18,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-26 07:57:18,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:57:18,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:57:18,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-26 07:57:19,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:19,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:57:19,075 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:19,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:57:19,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:57:19,131 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:57:19,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:57:19,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:57:19,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:57:19,229 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:19,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:57:19,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:57:19,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:57:19,336 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:57:19,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:19,414 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1841 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_135| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1840) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_135|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1841)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_135|) 0))) is different from false [2023-08-26 07:57:19,426 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:57:19,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 07:57:19,432 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:57:19,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 07:57:19,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 07:57:35,500 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_141| Int) (v_ArrVal_1841 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_135| Int) (v_ArrVal_1837 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1837) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_141| v_ArrVal_1841) |v_t_funThread1of2ForFork0_~p~0#1.offset_135|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_135| |v_t_funThread2of2ForFork0_~p~0#1.offset_141|)))) is different from false [2023-08-26 07:57:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 07:57:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853266725] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:37,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-08-26 07:57:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710934894] [2023-08-26 07:57:37,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:37,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-26 07:57:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-26 07:57:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=348, Unknown=7, NotChecked=78, Total=506 [2023-08-26 07:57:37,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 633 [2023-08-26 07:57:37,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 201 transitions, 1293 flow. Second operand has 23 states, 23 states have (on average 176.82608695652175) internal successors, (4067), 23 states have internal predecessors, (4067), 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) [2023-08-26 07:57:37,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:37,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 633 [2023-08-26 07:57:37,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:40,675 INFO L124 PetriNetUnfolderBase]: 6022/11816 cut-off events. [2023-08-26 07:57:40,676 INFO L125 PetriNetUnfolderBase]: For 251681/251753 co-relation queries the response was YES. [2023-08-26 07:57:40,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58913 conditions, 11816 events. 6022/11816 cut-off events. For 251681/251753 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 87943 event pairs, 1256 based on Foata normal form. 28/10992 useless extension candidates. Maximal degree in co-relation 58813. Up to 6898 conditions per place. [2023-08-26 07:57:40,770 INFO L140 encePairwiseOnDemand]: 620/633 looper letters, 369 selfloop transitions, 66 changer transitions 20/461 dead transitions. [2023-08-26 07:57:40,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 461 transitions, 3789 flow [2023-08-26 07:57:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 07:57:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 07:57:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3996 transitions. [2023-08-26 07:57:40,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3006093432633717 [2023-08-26 07:57:40,773 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3996 transitions. [2023-08-26 07:57:40,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3996 transitions. [2023-08-26 07:57:40,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:40,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3996 transitions. [2023-08-26 07:57:40,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 190.28571428571428) internal successors, (3996), 21 states have internal predecessors, (3996), 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) [2023-08-26 07:57:40,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 633.0) internal successors, (13926), 22 states have internal predecessors, (13926), 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) [2023-08-26 07:57:40,783 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 633.0) internal successors, (13926), 22 states have internal predecessors, (13926), 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) [2023-08-26 07:57:40,783 INFO L175 Difference]: Start difference. First operand has 228 places, 201 transitions, 1293 flow. Second operand 21 states and 3996 transitions. [2023-08-26 07:57:40,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 461 transitions, 3789 flow [2023-08-26 07:57:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 461 transitions, 3565 flow, removed 62 selfloop flow, removed 19 redundant places. [2023-08-26 07:57:41,067 INFO L231 Difference]: Finished difference. Result has 229 places, 229 transitions, 1846 flow [2023-08-26 07:57:41,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1204, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1846, PETRI_PLACES=229, PETRI_TRANSITIONS=229} [2023-08-26 07:57:41,067 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 65 predicate places. [2023-08-26 07:57:41,067 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 229 transitions, 1846 flow [2023-08-26 07:57:41,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 176.82608695652175) internal successors, (4067), 23 states have internal predecessors, (4067), 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) [2023-08-26 07:57:41,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:41,068 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:57:41,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-26 07:57:41,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:41,273 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:57:41,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2102468515, now seen corresponding path program 3 times [2023-08-26 07:57:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577763070] [2023-08-26 07:57:41,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:57:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577763070] [2023-08-26 07:57:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577763070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603356164] [2023-08-26 07:57:41,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 07:57:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:41,580 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:57:41,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-26 07:57:41,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 07:57:41,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:57:41,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 07:57:41,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:41,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:57:41,928 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:41,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:57:41,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:57:41,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:57:41,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:57:41,986 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:41,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:57:42,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:57:42,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:57:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:57:42,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:42,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 07:57:42,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 07:57:48,215 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_143| Int) (v_ArrVal_1971 (Array Int Int)) (v_ArrVal_1974 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_137| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_137| |v_t_funThread2of2ForFork0_~p~0#1.offset_143|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1971) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_137| v_ArrVal_1974) |v_t_funThread2of2ForFork0_~p~0#1.offset_143|)))) is different from false [2023-08-26 07:57:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 07:57:48,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603356164] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:48,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:48,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2023-08-26 07:57:48,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126027517] [2023-08-26 07:57:48,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:48,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 07:57:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:48,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 07:57:48,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=215, Unknown=2, NotChecked=30, Total=306 [2023-08-26 07:57:48,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 633 [2023-08-26 07:57:48,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 229 transitions, 1846 flow. Second operand has 18 states, 18 states have (on average 178.33333333333334) internal successors, (3210), 18 states have internal predecessors, (3210), 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) [2023-08-26 07:57:48,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:48,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 633 [2023-08-26 07:57:48,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:58:00,399 WARN L234 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 28 DAG size of output: 23 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:58:02,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:04,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:58:06,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:08,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:10,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:12,482 INFO L124 PetriNetUnfolderBase]: 6177/12193 cut-off events. [2023-08-26 07:58:12,483 INFO L125 PetriNetUnfolderBase]: For 366657/366725 co-relation queries the response was YES. [2023-08-26 07:58:12,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65728 conditions, 12193 events. 6177/12193 cut-off events. For 366657/366725 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 92628 event pairs, 1494 based on Foata normal form. 16/11328 useless extension candidates. Maximal degree in co-relation 65627. Up to 8923 conditions per place. [2023-08-26 07:58:12,582 INFO L140 encePairwiseOnDemand]: 620/633 looper letters, 327 selfloop transitions, 37 changer transitions 26/396 dead transitions. [2023-08-26 07:58:12,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 396 transitions, 3659 flow [2023-08-26 07:58:12,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 07:58:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 07:58:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2889 transitions. [2023-08-26 07:58:12,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3042654028436019 [2023-08-26 07:58:12,585 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2889 transitions. [2023-08-26 07:58:12,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2889 transitions. [2023-08-26 07:58:12,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:58:12,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2889 transitions. [2023-08-26 07:58:12,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 192.6) internal successors, (2889), 15 states have internal predecessors, (2889), 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) [2023-08-26 07:58:12,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 633.0) internal successors, (10128), 16 states have internal predecessors, (10128), 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) [2023-08-26 07:58:12,592 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 633.0) internal successors, (10128), 16 states have internal predecessors, (10128), 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) [2023-08-26 07:58:12,592 INFO L175 Difference]: Start difference. First operand has 229 places, 229 transitions, 1846 flow. Second operand 15 states and 2889 transitions. [2023-08-26 07:58:12,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 396 transitions, 3659 flow [2023-08-26 07:58:13,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 396 transitions, 3237 flow, removed 185 selfloop flow, removed 8 redundant places. [2023-08-26 07:58:13,608 INFO L231 Difference]: Finished difference. Result has 243 places, 241 transitions, 1817 flow [2023-08-26 07:58:13,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1817, PETRI_PLACES=243, PETRI_TRANSITIONS=241} [2023-08-26 07:58:13,609 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 79 predicate places. [2023-08-26 07:58:13,609 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 241 transitions, 1817 flow [2023-08-26 07:58:13,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 178.33333333333334) internal successors, (3210), 18 states have internal predecessors, (3210), 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) [2023-08-26 07:58:13,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:58:13,610 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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] [2023-08-26 07:58:13,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-26 07:58:13,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-26 07:58:13,811 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:58:13,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:58:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -624784078, now seen corresponding path program 3 times [2023-08-26 07:58:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:58:13,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256289272] [2023-08-26 07:58:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:58:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:58:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:58:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:58:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:58:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256289272] [2023-08-26 07:58:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256289272] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:58:14,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083118468] [2023-08-26 07:58:14,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 07:58:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:58:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:58:14,262 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:58:14,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-26 07:58:14,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 07:58:14,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:58:14,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-26 07:58:14,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:58:14,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:58:14,668 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:58:14,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:58:14,686 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:58:14,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:58:14,736 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:58:14,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:58:14,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:58:14,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:58:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:58:14,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:58:14,914 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:58:14,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:58:14,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:58:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:58:14,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:58:15,001 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_139| Int) (v_ArrVal_2110 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_139|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2110) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_139|)) 0)))) is different from false [2023-08-26 07:58:15,022 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_139| Int) (v_ArrVal_2110 (Array Int Int)) (v_ArrVal_2108 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2108)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_139|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2110) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_139|)) 0)))) is different from false [2023-08-26 07:58:15,065 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:58:15,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-26 07:58:15,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:58:15,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-26 07:58:15,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-26 07:58:27,168 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_145| Int) (v_ArrVal_2104 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_139| Int) (v_ArrVal_2108 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2104) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_145| v_ArrVal_2108) |v_t_funThread1of2ForFork0_~p~0#1.offset_139|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_139| |v_t_funThread2of2ForFork0_~p~0#1.offset_145|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-26 07:58:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-26 07:58:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083118468] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:58:29,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:58:29,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2023-08-26 07:58:29,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838952081] [2023-08-26 07:58:29,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:58:29,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 07:58:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:58:29,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 07:58:29,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=396, Unknown=6, NotChecked=132, Total=650 [2023-08-26 07:58:29,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 633 [2023-08-26 07:58:29,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 241 transitions, 1817 flow. Second operand has 26 states, 26 states have (on average 173.30769230769232) internal successors, (4506), 26 states have internal predecessors, (4506), 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) [2023-08-26 07:58:29,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:58:29,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 633 [2023-08-26 07:58:29,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:58:32,603 INFO L124 PetriNetUnfolderBase]: 6235/12405 cut-off events. [2023-08-26 07:58:32,603 INFO L125 PetriNetUnfolderBase]: For 364124/364230 co-relation queries the response was YES. [2023-08-26 07:58:32,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62065 conditions, 12405 events. 6235/12405 cut-off events. For 364124/364230 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 95407 event pairs, 943 based on Foata normal form. 6/11507 useless extension candidates. Maximal degree in co-relation 61958. Up to 8006 conditions per place. [2023-08-26 07:58:32,713 INFO L140 encePairwiseOnDemand]: 619/633 looper letters, 332 selfloop transitions, 95 changer transitions 8/441 dead transitions. [2023-08-26 07:58:32,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 441 transitions, 4285 flow [2023-08-26 07:58:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 07:58:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 07:58:32,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3521 transitions. [2023-08-26 07:58:32,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2927579612538455 [2023-08-26 07:58:32,717 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3521 transitions. [2023-08-26 07:58:32,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3521 transitions. [2023-08-26 07:58:32,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:58:32,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3521 transitions. [2023-08-26 07:58:32,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 185.31578947368422) internal successors, (3521), 19 states have internal predecessors, (3521), 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) [2023-08-26 07:58:32,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 633.0) internal successors, (12660), 20 states have internal predecessors, (12660), 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) [2023-08-26 07:58:32,725 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 633.0) internal successors, (12660), 20 states have internal predecessors, (12660), 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) [2023-08-26 07:58:32,725 INFO L175 Difference]: Start difference. First operand has 243 places, 241 transitions, 1817 flow. Second operand 19 states and 3521 transitions. [2023-08-26 07:58:32,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 441 transitions, 4285 flow [2023-08-26 07:58:33,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 441 transitions, 4079 flow, removed 93 selfloop flow, removed 5 redundant places. [2023-08-26 07:58:33,343 INFO L231 Difference]: Finished difference. Result has 262 places, 279 transitions, 2438 flow [2023-08-26 07:58:33,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2438, PETRI_PLACES=262, PETRI_TRANSITIONS=279} [2023-08-26 07:58:33,343 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 98 predicate places. [2023-08-26 07:58:33,343 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 279 transitions, 2438 flow [2023-08-26 07:58:33,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 173.30769230769232) internal successors, (4506), 26 states have internal predecessors, (4506), 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) [2023-08-26 07:58:33,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:58:33,344 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 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] [2023-08-26 07:58:33,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-26 07:58:33,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-26 07:58:33,544 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:58:33,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:58:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1171650447, now seen corresponding path program 4 times [2023-08-26 07:58:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:58:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734144417] [2023-08-26 07:58:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:58:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:58:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:58:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:58:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:58:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734144417] [2023-08-26 07:58:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734144417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:58:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056638223] [2023-08-26 07:58:33,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 07:58:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:58:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:58:33,863 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:58:33,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-26 07:58:34,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 07:58:34,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:58:34,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-26 07:58:34,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:58:34,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:58:34,111 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:58:34,112 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:58:34,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:58:34,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:58:34,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:58:34,233 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:58:34,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-26 07:58:34,315 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:58:34,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:58:34,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:58:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-26 07:58:34,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:58:34,424 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2248) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-26 07:58:34,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-26 07:58:34,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-26 07:58:34,571 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2248 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_141| Int) (v_ArrVal_2245 (Array Int Int)) (v_ArrVal_2247 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_147| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_141| |v_t_funThread2of2ForFork0_~p~0#1.offset_147|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2245))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_147| v_ArrVal_2247))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2248) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_141|) 0))) is different from false [2023-08-26 07:58:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 5 not checked. [2023-08-26 07:58:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056638223] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:58:34,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:58:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2023-08-26 07:58:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66258551] [2023-08-26 07:58:34,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:58:34,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-26 07:58:34,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:58:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-26 07:58:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=304, Unknown=9, NotChecked=74, Total=462 [2023-08-26 07:58:34,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 633 [2023-08-26 07:58:34,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 279 transitions, 2438 flow. Second operand has 22 states, 22 states have (on average 177.1818181818182) internal successors, (3898), 22 states have internal predecessors, (3898), 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) [2023-08-26 07:58:34,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:58:34,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 633 [2023-08-26 07:58:34,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:58:48,800 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification. DAG size of input: 38 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:58:50,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:52,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:58:54,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:56,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:58:58,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:00,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:03,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:05,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:07,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:59:10,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:12,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:14,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:59:16,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:18,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:20,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:22,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:24,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:26,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:28,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:30,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:59:32,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:34,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:36,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:38,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:59:40,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:42,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:44,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:46,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:59:48,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:59:52,078 INFO L124 PetriNetUnfolderBase]: 6241/12442 cut-off events. [2023-08-26 07:59:52,078 INFO L125 PetriNetUnfolderBase]: For 410865/410937 co-relation queries the response was YES. [2023-08-26 07:59:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65271 conditions, 12442 events. 6241/12442 cut-off events. For 410865/410937 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 95492 event pairs, 1418 based on Foata normal form. 6/11527 useless extension candidates. Maximal degree in co-relation 65156. Up to 8230 conditions per place. [2023-08-26 07:59:52,193 INFO L140 encePairwiseOnDemand]: 620/633 looper letters, 379 selfloop transitions, 56 changer transitions 20/461 dead transitions. [2023-08-26 07:59:52,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 461 transitions, 4494 flow [2023-08-26 07:59:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 07:59:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 07:59:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3058 transitions. [2023-08-26 07:59:52,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30193522906793047 [2023-08-26 07:59:52,196 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3058 transitions. [2023-08-26 07:59:52,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3058 transitions. [2023-08-26 07:59:52,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:59:52,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3058 transitions. [2023-08-26 07:59:52,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 191.125) internal successors, (3058), 16 states have internal predecessors, (3058), 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) [2023-08-26 07:59:52,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 633.0) internal successors, (10761), 17 states have internal predecessors, (10761), 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) [2023-08-26 07:59:52,203 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 633.0) internal successors, (10761), 17 states have internal predecessors, (10761), 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) [2023-08-26 07:59:52,203 INFO L175 Difference]: Start difference. First operand has 262 places, 279 transitions, 2438 flow. Second operand 16 states and 3058 transitions. [2023-08-26 07:59:52,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 461 transitions, 4494 flow [2023-08-26 07:59:52,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 461 transitions, 4218 flow, removed 125 selfloop flow, removed 5 redundant places. [2023-08-26 07:59:52,886 INFO L231 Difference]: Finished difference. Result has 276 places, 284 transitions, 2370 flow [2023-08-26 07:59:52,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=633, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2370, PETRI_PLACES=276, PETRI_TRANSITIONS=284} [2023-08-26 07:59:52,887 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 112 predicate places. [2023-08-26 07:59:52,887 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 284 transitions, 2370 flow [2023-08-26 07:59:52,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 177.1818181818182) internal successors, (3898), 22 states have internal predecessors, (3898), 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) [2023-08-26 07:59:52,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:59:52,888 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 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] [2023-08-26 07:59:52,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-26 07:59:53,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:59:53,088 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 07:59:53,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:59:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash 231138694, now seen corresponding path program 4 times [2023-08-26 07:59:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:59:53,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667268261] [2023-08-26 07:59:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:59:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:59:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat