/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_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 07:54:26,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 07:54:26,771 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:54:26,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 07:54:26,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 07:54:26,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 07:54:26,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 07:54:26,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 07:54:26,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 07:54:26,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 07:54:26,797 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 07:54:26,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 07:54:26,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 07:54:26,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 07:54:26,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 07:54:26,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 07:54:26,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 07:54:26,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 07:54:26,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 07:54:26,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 07:54:26,803 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 07:54:26,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 07:54:26,805 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 07:54:26,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 07:54:26,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 07:54:26,806 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 07:54:26,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 07:54:26,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:54:26,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 07:54:26,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 07:54:26,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 07:54:26,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 07:54:26,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 07:54:26,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 07:54:26,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 07:54:26,808 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:54:27,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 07:54:27,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 07:54:27,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 07:54:27,123 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 07:54:27,124 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 07:54:27,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-26 07:54:28,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 07:54:28,472 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 07:54:28,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-26 07:54:28,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26171804d/ddb0353fe9014abb9e376c3699473273/FLAG5cf3af5ef [2023-08-26 07:54:28,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26171804d/ddb0353fe9014abb9e376c3699473273 [2023-08-26 07:54:28,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 07:54:28,505 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 07:54:28,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 07:54:28,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 07:54:28,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 07:54:28,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:54:28" (1/1) ... [2023-08-26 07:54:28,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65264cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:28, skipping insertion in model container [2023-08-26 07:54:28,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:54:28" (1/1) ... [2023-08-26 07:54:28,553 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 07:54:28,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:54:29,021 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 07:54:29,040 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:54:29,042 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:54:29,048 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 07:54:29,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:54:29,127 INFO L206 MainTranslator]: Completed translation [2023-08-26 07:54:29,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29 WrapperNode [2023-08-26 07:54:29,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 07:54:29,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 07:54:29,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 07:54:29,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 07:54:29,136 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:54:29" (1/1) ... [2023-08-26 07:54:29,169 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:54:29" (1/1) ... [2023-08-26 07:54:29,217 INFO L138 Inliner]: procedures = 270, calls = 42, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 265 [2023-08-26 07:54:29,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 07:54:29,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 07:54:29,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 07:54:29,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 07:54:29,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 07:54:29,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 07:54:29,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 07:54:29,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 07:54:29,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (1/1) ... [2023-08-26 07:54:29,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:54:29,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:29,326 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:54:29,341 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:54:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 07:54:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 07:54:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 07:54:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 07:54:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 07:54:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 07:54:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 07:54:29,366 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 07:54:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 07:54:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 07:54:29,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 07:54:29,367 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:54:29,551 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 07:54:29,554 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 07:54:29,912 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 07:54:29,919 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 07:54:29,920 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-26 07:54:29,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:54:29 BoogieIcfgContainer [2023-08-26 07:54:29,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 07:54:29,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 07:54:29,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 07:54:29,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 07:54:29,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:54:28" (1/3) ... [2023-08-26 07:54:29,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdffca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:54:29, skipping insertion in model container [2023-08-26 07:54:29,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:54:29" (2/3) ... [2023-08-26 07:54:29,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdffca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:54:29, skipping insertion in model container [2023-08-26 07:54:29,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:54:29" (3/3) ... [2023-08-26 07:54:29,929 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-08-26 07:54:29,942 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 07:54:29,942 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-08-26 07:54:29,942 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 07:54:30,028 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 07:54:30,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 278 transitions, 564 flow [2023-08-26 07:54:30,248 INFO L124 PetriNetUnfolderBase]: 48/394 cut-off events. [2023-08-26 07:54:30,249 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:54:30,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 394 events. 48/394 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1614 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 230. Up to 8 conditions per place. [2023-08-26 07:54:30,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 278 transitions, 564 flow [2023-08-26 07:54:30,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 278 transitions, 564 flow [2023-08-26 07:54:30,280 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:54:30,291 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 278 transitions, 564 flow [2023-08-26 07:54:30,298 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 278 transitions, 564 flow [2023-08-26 07:54:30,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 278 transitions, 564 flow [2023-08-26 07:54:30,372 INFO L124 PetriNetUnfolderBase]: 48/394 cut-off events. [2023-08-26 07:54:30,373 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:54:30,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 394 events. 48/394 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1614 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 230. Up to 8 conditions per place. [2023-08-26 07:54:30,392 INFO L119 LiptonReduction]: Number of co-enabled transitions 26596 [2023-08-26 07:54:33,599 INFO L134 LiptonReduction]: Checked pairs total: 102196 [2023-08-26 07:54:33,600 INFO L136 LiptonReduction]: Total number of compositions: 187 [2023-08-26 07:54:33,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:54:33,616 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;@12e659a1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:54:33,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-08-26 07:54:33,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:54:33,623 INFO L124 PetriNetUnfolderBase]: 19/88 cut-off events. [2023-08-26 07:54:33,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:54:33,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:33,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:33,624 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:54:33,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1597504909, now seen corresponding path program 1 times [2023-08-26 07:54:33,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:33,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851847928] [2023-08-26 07:54:33,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:33,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:33,868 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:33,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:33,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851847928] [2023-08-26 07:54:33,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851847928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:33,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:54:33,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:54:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104885608] [2023-08-26 07:54:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:33,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:54:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:54:33,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:54:33,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 465 [2023-08-26 07:54:33,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 134 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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:33,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:33,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 465 [2023-08-26 07:54:33,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:34,180 INFO L124 PetriNetUnfolderBase]: 440/1647 cut-off events. [2023-08-26 07:54:34,180 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2023-08-26 07:54:34,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2514 conditions, 1647 events. 440/1647 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 12008 event pairs, 396 based on Foata normal form. 167/1600 useless extension candidates. Maximal degree in co-relation 2414. Up to 860 conditions per place. [2023-08-26 07:54:34,190 INFO L140 encePairwiseOnDemand]: 441/465 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-08-26 07:54:34,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 330 flow [2023-08-26 07:54:34,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:54:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:54:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-08-26 07:54:34,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2023-08-26 07:54:34,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-08-26 07:54:34,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-08-26 07:54:34,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:34,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-08-26 07:54:34,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 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:34,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 465.0) internal successors, (1860), 4 states have internal predecessors, (1860), 0 states have call successors, (0), 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:34,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 465.0) internal successors, (1860), 4 states have internal predecessors, (1860), 0 states have call successors, (0), 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:34,228 INFO L175 Difference]: Start difference. First operand has 112 places, 134 transitions, 276 flow. Second operand 3 states and 780 transitions. [2023-08-26 07:54:34,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 330 flow [2023-08-26 07:54:34,232 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:54:34,235 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 246 flow [2023-08-26 07:54:34,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:34,240 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 3 predicate places. [2023-08-26 07:54:34,241 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 246 flow [2023-08-26 07:54:34,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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:34,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:34,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:34,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 07:54:34,242 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:54:34,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1671413252, now seen corresponding path program 1 times [2023-08-26 07:54:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:34,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880866292] [2023-08-26 07:54:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:34,390 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:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880866292] [2023-08-26 07:54:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880866292] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370990055] [2023-08-26 07:54:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:34,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:34,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:34,401 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:54:34,433 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:54:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:34,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:54:34,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:34,534 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:34,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:54:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370990055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:54:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:54:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579255923] [2023-08-26 07:54:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:54:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:54:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:54:34,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 465 [2023-08-26 07:54:34,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 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:34,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:34,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 465 [2023-08-26 07:54:34,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:34,757 INFO L124 PetriNetUnfolderBase]: 417/1581 cut-off events. [2023-08-26 07:54:34,758 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 07:54:34,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1581 events. 417/1581 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 11884 event pairs, 0 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 2443. Up to 822 conditions per place. [2023-08-26 07:54:34,766 INFO L140 encePairwiseOnDemand]: 462/465 looper letters, 64 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2023-08-26 07:54:34,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 133 transitions, 416 flow [2023-08-26 07:54:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:54:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:54:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2023-08-26 07:54:34,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556989247311828 [2023-08-26 07:54:34,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 777 transitions. [2023-08-26 07:54:34,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 777 transitions. [2023-08-26 07:54:34,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:34,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 777 transitions. [2023-08-26 07:54:34,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 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:34,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 465.0) internal successors, (1860), 4 states have internal predecessors, (1860), 0 states have call successors, (0), 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:34,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 465.0) internal successors, (1860), 4 states have internal predecessors, (1860), 0 states have call successors, (0), 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:34,775 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 246 flow. Second operand 3 states and 777 transitions. [2023-08-26 07:54:34,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 133 transitions, 416 flow [2023-08-26 07:54:34,777 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:54:34,779 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 250 flow [2023-08-26 07:54:34,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:34,780 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 5 predicate places. [2023-08-26 07:54:34,780 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 250 flow [2023-08-26 07:54:34,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 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:34,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:34,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:34,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 07:54:34,987 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:54:34,987 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:54:34,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:34,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1889792067, now seen corresponding path program 1 times [2023-08-26 07:54:34,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:34,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083596846] [2023-08-26 07:54:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:35,046 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:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083596846] [2023-08-26 07:54:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083596846] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990714313] [2023-08-26 07:54:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:35,077 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:54:35,080 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:54:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:35,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:54:35,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:35,180 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:35,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:35,198 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:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990714313] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:35,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:54:35,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995911713] [2023-08-26 07:54:35,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:35,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:54:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:54:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:54:35,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 465 [2023-08-26 07:54:35,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 238.85714285714286) internal successors, (1672), 7 states have internal predecessors, (1672), 0 states have call successors, (0), 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:35,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:35,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 465 [2023-08-26 07:54:35,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:35,454 INFO L124 PetriNetUnfolderBase]: 438/1640 cut-off events. [2023-08-26 07:54:35,454 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-26 07:54:35,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 1640 events. 438/1640 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 12030 event pairs, 396 based on Foata normal form. 3/1450 useless extension candidates. Maximal degree in co-relation 2532. Up to 842 conditions per place. [2023-08-26 07:54:35,463 INFO L140 encePairwiseOnDemand]: 462/465 looper letters, 45 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2023-08-26 07:54:35,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 117 transitions, 362 flow [2023-08-26 07:54:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:54:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:54:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1475 transitions. [2023-08-26 07:54:35,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286738351254481 [2023-08-26 07:54:35,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1475 transitions. [2023-08-26 07:54:35,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1475 transitions. [2023-08-26 07:54:35,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:35,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1475 transitions. [2023-08-26 07:54:35,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 0 states have call successors, (0), 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:35,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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:35,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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:35,477 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 250 flow. Second operand 6 states and 1475 transitions. [2023-08-26 07:54:35,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 117 transitions, 362 flow [2023-08-26 07:54:35,481 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:54:35,484 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 282 flow [2023-08-26 07:54:35,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:35,485 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 11 predicate places. [2023-08-26 07:54:35,485 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 282 flow [2023-08-26 07:54:35,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 238.85714285714286) internal successors, (1672), 7 states have internal predecessors, (1672), 0 states have call successors, (0), 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:35,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:35,487 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:35,495 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:54:35,695 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:54:35,695 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:54:35,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2131338961, now seen corresponding path program 2 times [2023-08-26 07:54:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:35,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215148914] [2023-08-26 07:54:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:35,799 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:35,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:35,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215148914] [2023-08-26 07:54:35,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215148914] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:35,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967548450] [2023-08-26 07:54:35,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:54:35,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:35,805 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:54:35,828 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:54:35,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:54:35,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:54:35,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 07:54:35,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:35,922 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:35,937 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:35,958 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:54:35,959 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:35,993 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:54:35,993 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:36,015 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:36,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:54:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967548450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:36,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:54:36,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 07:54:36,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868342572] [2023-08-26 07:54:36,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:36,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:54:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:36,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:54:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:54:36,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 465 [2023-08-26 07:54:36,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 282 flow. Second operand has 6 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:36,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:36,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 465 [2023-08-26 07:54:36,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:37,070 INFO L124 PetriNetUnfolderBase]: 2901/6070 cut-off events. [2023-08-26 07:54:37,070 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-26 07:54:37,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12066 conditions, 6070 events. 2901/6070 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 40043 event pairs, 1246 based on Foata normal form. 0/5223 useless extension candidates. Maximal degree in co-relation 12031. Up to 3765 conditions per place. [2023-08-26 07:54:37,105 INFO L140 encePairwiseOnDemand]: 436/465 looper letters, 290 selfloop transitions, 50 changer transitions 0/350 dead transitions. [2023-08-26 07:54:37,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 350 transitions, 1443 flow [2023-08-26 07:54:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:54:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:54:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1365 transitions. [2023-08-26 07:54:37,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2023-08-26 07:54:37,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1365 transitions. [2023-08-26 07:54:37,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1365 transitions. [2023-08-26 07:54:37,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:37,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1365 transitions. [2023-08-26 07:54:37,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 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,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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,119 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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,119 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 282 flow. Second operand 6 states and 1365 transitions. [2023-08-26 07:54:37,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 350 transitions, 1443 flow [2023-08-26 07:54:37,122 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:54:37,126 INFO L231 Difference]: Finished difference. Result has 132 places, 164 transitions, 614 flow [2023-08-26 07:54:37,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:37,126 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2023-08-26 07:54:37,127 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 164 transitions, 614 flow [2023-08-26 07:54:37,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:37,128 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:37,138 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:54:37,335 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:54:37,335 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:54:37,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2131338731, now seen corresponding path program 1 times [2023-08-26 07:54:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842687549] [2023-08-26 07:54:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:37,449 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:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842687549] [2023-08-26 07:54:37,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842687549] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132044591] [2023-08-26 07:54:37,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:37,451 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:54:37,453 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:54:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:37,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:54:37,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:37,552 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:37,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:37,599 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:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132044591] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:37,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 07:54:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790131748] [2023-08-26 07:54:37,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:54:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:54:37,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 07:54:37,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 465 [2023-08-26 07:54:37,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 164 transitions, 614 flow. Second operand has 13 states, 13 states have (on average 238.53846153846155) internal successors, (3101), 13 states have internal predecessors, (3101), 0 states have call successors, (0), 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,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:37,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 465 [2023-08-26 07:54:37,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:38,042 INFO L124 PetriNetUnfolderBase]: 749/2692 cut-off events. [2023-08-26 07:54:38,042 INFO L125 PetriNetUnfolderBase]: For 447/482 co-relation queries the response was YES. [2023-08-26 07:54:38,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5339 conditions, 2692 events. 749/2692 cut-off events. For 447/482 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 20756 event pairs, 448 based on Foata normal form. 15/2434 useless extension candidates. Maximal degree in co-relation 5282. Up to 1247 conditions per place. [2023-08-26 07:54:38,060 INFO L140 encePairwiseOnDemand]: 462/465 looper letters, 57 selfloop transitions, 11 changer transitions 0/170 dead transitions. [2023-08-26 07:54:38,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 170 transitions, 786 flow [2023-08-26 07:54:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:54:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:54:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2906 transitions. [2023-08-26 07:54:38,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5207885304659499 [2023-08-26 07:54:38,067 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2906 transitions. [2023-08-26 07:54:38,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2906 transitions. [2023-08-26 07:54:38,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:38,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2906 transitions. [2023-08-26 07:54:38,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 242.16666666666666) internal successors, (2906), 12 states have internal predecessors, (2906), 0 states have call successors, (0), 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,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 465.0) internal successors, (6045), 13 states have internal predecessors, (6045), 0 states have call successors, (0), 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,083 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 465.0) internal successors, (6045), 13 states have internal predecessors, (6045), 0 states have call successors, (0), 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,084 INFO L175 Difference]: Start difference. First operand has 132 places, 164 transitions, 614 flow. Second operand 12 states and 2906 transitions. [2023-08-26 07:54:38,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 170 transitions, 786 flow [2023-08-26 07:54:38,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 170 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:54:38,092 INFO L231 Difference]: Finished difference. Result has 149 places, 170 transitions, 698 flow [2023-08-26 07:54:38,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:38,093 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 37 predicate places. [2023-08-26 07:54:38,093 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 170 transitions, 698 flow [2023-08-26 07:54:38,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 238.53846153846155) internal successors, (3101), 13 states have internal predecessors, (3101), 0 states have call successors, (0), 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,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:38,094 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:38,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 07:54:38,300 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:54:38,300 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:54:38,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1043939733, now seen corresponding path program 2 times [2023-08-26 07:54:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111233167] [2023-08-26 07:54:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:38,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:38,519 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,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111233167] [2023-08-26 07:54:38,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111233167] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:54:38,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:54:38,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:54:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121482117] [2023-08-26 07:54:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:54:38,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:54:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:54:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:54:38,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 465 [2023-08-26 07:54:38,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 170 transitions, 698 flow. Second operand has 7 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 states have internal predecessors, (1000), 0 states have call successors, (0), 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,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:38,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 465 [2023-08-26 07:54:38,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:39,699 INFO L124 PetriNetUnfolderBase]: 3437/7293 cut-off events. [2023-08-26 07:54:39,699 INFO L125 PetriNetUnfolderBase]: For 2425/2425 co-relation queries the response was YES. [2023-08-26 07:54:39,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18350 conditions, 7293 events. 3437/7293 cut-off events. For 2425/2425 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 49590 event pairs, 1019 based on Foata normal form. 0/6464 useless extension candidates. Maximal degree in co-relation 18268. Up to 5191 conditions per place. [2023-08-26 07:54:39,750 INFO L140 encePairwiseOnDemand]: 455/465 looper letters, 362 selfloop transitions, 17 changer transitions 19/406 dead transitions. [2023-08-26 07:54:39,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 406 transitions, 2280 flow [2023-08-26 07:54:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 07:54:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 07:54:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1719 transitions. [2023-08-26 07:54:39,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696774193548387 [2023-08-26 07:54:39,756 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1719 transitions. [2023-08-26 07:54:39,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1719 transitions. [2023-08-26 07:54:39,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:39,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1719 transitions. [2023-08-26 07:54:39,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 171.9) internal successors, (1719), 10 states have internal predecessors, (1719), 0 states have call successors, (0), 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:39,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 465.0) internal successors, (5115), 11 states have internal predecessors, (5115), 0 states have call successors, (0), 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:39,767 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 465.0) internal successors, (5115), 11 states have internal predecessors, (5115), 0 states have call successors, (0), 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:39,767 INFO L175 Difference]: Start difference. First operand has 149 places, 170 transitions, 698 flow. Second operand 10 states and 1719 transitions. [2023-08-26 07:54:39,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 406 transitions, 2280 flow [2023-08-26 07:54:39,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 406 transitions, 2232 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:54:39,810 INFO L231 Difference]: Finished difference. Result has 160 places, 185 transitions, 778 flow [2023-08-26 07:54:39,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:39,811 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 48 predicate places. [2023-08-26 07:54:39,811 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 185 transitions, 778 flow [2023-08-26 07:54:39,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 states have internal predecessors, (1000), 0 states have call successors, (0), 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:39,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:39,812 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:39,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 07:54:39,813 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:54:39,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1990497275, now seen corresponding path program 1 times [2023-08-26 07:54:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074796165] [2023-08-26 07:54:39,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:39,864 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:54:39,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074796165] [2023-08-26 07:54:39,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074796165] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:39,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298500708] [2023-08-26 07:54:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:39,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:39,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:39,866 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:54:39,893 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:54:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:39,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:54:39,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:39,993 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:54:39,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:40,010 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:54:40,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298500708] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:40,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:40,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 07:54:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995050230] [2023-08-26 07:54:40,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:54:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:54:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:54:40,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 465 [2023-08-26 07:54:40,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 185 transitions, 778 flow. Second operand has 7 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 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,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:40,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 465 [2023-08-26 07:54:40,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:54:40,066 INFO L124 PetriNetUnfolderBase]: 35/175 cut-off events. [2023-08-26 07:54:40,066 INFO L125 PetriNetUnfolderBase]: For 170/173 co-relation queries the response was YES. [2023-08-26 07:54:40,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 175 events. 35/175 cut-off events. For 170/173 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 538 event pairs, 0 based on Foata normal form. 20/188 useless extension candidates. Maximal degree in co-relation 483. Up to 81 conditions per place. [2023-08-26 07:54:40,067 INFO L140 encePairwiseOnDemand]: 462/465 looper letters, 41 selfloop transitions, 2 changer transitions 13/83 dead transitions. [2023-08-26 07:54:40,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 83 transitions, 465 flow [2023-08-26 07:54:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 07:54:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 07:54:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 991 transitions. [2023-08-26 07:54:40,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5327956989247312 [2023-08-26 07:54:40,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 991 transitions. [2023-08-26 07:54:40,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 991 transitions. [2023-08-26 07:54:40,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:40,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 991 transitions. [2023-08-26 07:54:40,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 247.75) internal successors, (991), 4 states have internal predecessors, (991), 0 states have call successors, (0), 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,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 465.0) internal successors, (2325), 5 states have internal predecessors, (2325), 0 states have call successors, (0), 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,077 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 465.0) internal successors, (2325), 5 states have internal predecessors, (2325), 0 states have call successors, (0), 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,077 INFO L175 Difference]: Start difference. First operand has 160 places, 185 transitions, 778 flow. Second operand 4 states and 991 transitions. [2023-08-26 07:54:40,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 83 transitions, 465 flow [2023-08-26 07:54:40,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 370 flow, removed 9 selfloop flow, removed 18 redundant places. [2023-08-26 07:54:40,080 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 189 flow [2023-08-26 07:54:40,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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:54:40,081 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -30 predicate places. [2023-08-26 07:54:40,081 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 58 transitions, 189 flow [2023-08-26 07:54:40,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.57142857142858) internal successors, (1677), 7 states have internal predecessors, (1677), 0 states have call successors, (0), 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,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:40,082 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:40,096 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:54:40,293 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:54:40,293 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:54:40,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1041121597, now seen corresponding path program 1 times [2023-08-26 07:54:40,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:40,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800764946] [2023-08-26 07:54:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:40,540 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:54:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800764946] [2023-08-26 07:54:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800764946] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305788780] [2023-08-26 07:54:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:40,542 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:54:40,545 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:54:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:40,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 07:54:40,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:40,653 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:54:40,725 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:54:40,725 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:54:40,747 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:54:40,783 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:54:40,804 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:54:40,831 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:54:40,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:54:48,862 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:54:48,872 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:54:48,955 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:54:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305788780] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:54:48,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:54:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-26 07:54:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059963925] [2023-08-26 07:54:48,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:54:48,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 07:54:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:54:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 07:54:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=99, Unknown=6, NotChecked=42, Total=182 [2023-08-26 07:54:48,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 465 [2023-08-26 07:54:48,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 58 transitions, 189 flow. Second operand has 14 states, 14 states have (on average 143.35714285714286) internal successors, (2007), 14 states have internal predecessors, (2007), 0 states have call successors, (0), 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:48,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:54:48,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 465 [2023-08-26 07:54:48,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:05,034 WARN L234 SmtUtils]: Spent 14.05s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:55:07,038 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:55:09,040 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:55:11,053 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:55:13,054 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:55:15,060 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:55:17,074 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:55:19,085 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:55:21,087 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:55:23,122 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:55:25,124 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:55:27,258 INFO L124 PetriNetUnfolderBase]: 61/196 cut-off events. [2023-08-26 07:55:27,258 INFO L125 PetriNetUnfolderBase]: For 161/162 co-relation queries the response was YES. [2023-08-26 07:55:27,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 196 events. 61/196 cut-off events. For 161/162 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 432 event pairs, 9 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 475. Up to 102 conditions per place. [2023-08-26 07:55:27,259 INFO L140 encePairwiseOnDemand]: 458/465 looper letters, 45 selfloop transitions, 7 changer transitions 7/62 dead transitions. [2023-08-26 07:55:27,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 62 transitions, 326 flow [2023-08-26 07:55:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:55:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:55:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1035 transitions. [2023-08-26 07:55:27,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31797235023041476 [2023-08-26 07:55:27,263 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1035 transitions. [2023-08-26 07:55:27,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1035 transitions. [2023-08-26 07:55:27,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:27,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1035 transitions. [2023-08-26 07:55:27,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 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:27,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 465.0) internal successors, (3720), 8 states have internal predecessors, (3720), 0 states have call successors, (0), 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:27,271 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 465.0) internal successors, (3720), 8 states have internal predecessors, (3720), 0 states have call successors, (0), 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:27,271 INFO L175 Difference]: Start difference. First operand has 82 places, 58 transitions, 189 flow. Second operand 7 states and 1035 transitions. [2023-08-26 07:55:27,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 62 transitions, 326 flow [2023-08-26 07:55:27,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 62 transitions, 315 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 07:55:27,273 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 191 flow [2023-08-26 07:55:27,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, 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=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2023-08-26 07:55:27,274 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -33 predicate places. [2023-08-26 07:55:27,274 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 191 flow [2023-08-26 07:55:27,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 143.35714285714286) internal successors, (2007), 14 states have internal predecessors, (2007), 0 states have call successors, (0), 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:27,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:27,275 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:55:27,286 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:55:27,475 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:55:27,476 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:55:27,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1683307432, now seen corresponding path program 1 times [2023-08-26 07:55:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:27,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557739138] [2023-08-26 07:55:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:27,862 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:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:27,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557739138] [2023-08-26 07:55:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557739138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:27,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:55:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:55:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510533587] [2023-08-26 07:55:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:27,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:55:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:55:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:55:27,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 465 [2023-08-26 07:55:27,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 52 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 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:27,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:27,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 465 [2023-08-26 07:55:27,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:27,941 INFO L124 PetriNetUnfolderBase]: 57/176 cut-off events. [2023-08-26 07:55:27,941 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2023-08-26 07:55:27,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 176 events. 57/176 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 316 event pairs, 22 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 448. Up to 142 conditions per place. [2023-08-26 07:55:27,942 INFO L140 encePairwiseOnDemand]: 459/465 looper letters, 51 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-26 07:55:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 337 flow [2023-08-26 07:55:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:55:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:55:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1057 transitions. [2023-08-26 07:55:27,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3788530465949821 [2023-08-26 07:55:27,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1057 transitions. [2023-08-26 07:55:27,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1057 transitions. [2023-08-26 07:55:27,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:27,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1057 transitions. [2023-08-26 07:55:27,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 0 states have call successors, (0), 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:27,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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:27,952 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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:27,952 INFO L175 Difference]: Start difference. First operand has 79 places, 52 transitions, 191 flow. Second operand 6 states and 1057 transitions. [2023-08-26 07:55:27,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 337 flow [2023-08-26 07:55:27,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 59 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 07:55:27,954 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 190 flow [2023-08-26 07:55:27,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-08-26 07:55:27,956 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -40 predicate places. [2023-08-26 07:55:27,956 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 190 flow [2023-08-26 07:55:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 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:27,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:27,957 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:55:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 07:55:27,958 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:55:27,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1861883172, now seen corresponding path program 1 times [2023-08-26 07:55:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211382100] [2023-08-26 07:55:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:28,351 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:28,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211382100] [2023-08-26 07:55:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211382100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:55:28,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:55:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508335430] [2023-08-26 07:55:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:28,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:55:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:55:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:55:28,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 465 [2023-08-26 07:55:28,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 0 states have call successors, (0), 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:28,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:28,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 465 [2023-08-26 07:55:28,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:28,416 INFO L124 PetriNetUnfolderBase]: 55/171 cut-off events. [2023-08-26 07:55:28,416 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2023-08-26 07:55:28,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 171 events. 55/171 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 308 event pairs, 22 based on Foata normal form. 3/173 useless extension candidates. Maximal degree in co-relation 443. Up to 142 conditions per place. [2023-08-26 07:55:28,417 INFO L140 encePairwiseOnDemand]: 460/465 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2023-08-26 07:55:28,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 58 transitions, 334 flow [2023-08-26 07:55:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:55:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:55:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions. [2023-08-26 07:55:28,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37849462365591396 [2023-08-26 07:55:28,420 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions. [2023-08-26 07:55:28,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions. [2023-08-26 07:55:28,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:28,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions. [2023-08-26 07:55:28,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 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:28,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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:28,426 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 465.0) internal successors, (3255), 7 states have internal predecessors, (3255), 0 states have call successors, (0), 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:28,426 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 190 flow. Second operand 6 states and 1056 transitions. [2023-08-26 07:55:28,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 58 transitions, 334 flow [2023-08-26 07:55:28,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 58 transitions, 324 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 07:55:28,428 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2023-08-26 07:55:28,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=465, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2023-08-26 07:55:28,428 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -41 predicate places. [2023-08-26 07:55:28,429 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2023-08-26 07:55:28,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.5) internal successors, (1047), 6 states have internal predecessors, (1047), 0 states have call successors, (0), 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:28,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2023-08-26 07:55:28,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-08-26 07:55:28,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONASSERT (13 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONASSERT (7 of 19 remaining) [2023-08-26 07:55:28,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-08-26 07:55:28,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-08-26 07:55:28,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONASSERT (4 of 19 remaining) [2023-08-26 07:55:28,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-08-26 07:55:28,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-08-26 07:55:28,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-08-26 07:55:28,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-08-26 07:55:28,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 07:55:28,433 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:28,435 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:55:28,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 278 transitions, 564 flow [2023-08-26 07:55:28,467 INFO L124 PetriNetUnfolderBase]: 48/394 cut-off events. [2023-08-26 07:55:28,467 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:55:28,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 394 events. 48/394 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1614 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 230. Up to 8 conditions per place. [2023-08-26 07:55:28,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 278 transitions, 564 flow [2023-08-26 07:55:28,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 273 transitions, 551 flow [2023-08-26 07:55:28,471 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:55:28,471 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 273 transitions, 551 flow [2023-08-26 07:55:28,471 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 273 transitions, 551 flow [2023-08-26 07:55:28,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 273 transitions, 551 flow [2023-08-26 07:55:28,498 INFO L124 PetriNetUnfolderBase]: 47/389 cut-off events. [2023-08-26 07:55:28,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:55:28,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 389 events. 47/389 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1553 event pairs, 0 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 230. Up to 8 conditions per place. [2023-08-26 07:55:28,510 INFO L119 LiptonReduction]: Number of co-enabled transitions 26596 [2023-08-26 07:55:31,045 INFO L134 LiptonReduction]: Checked pairs total: 100870 [2023-08-26 07:55:31,045 INFO L136 LiptonReduction]: Total number of compositions: 185 [2023-08-26 07:55:31,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 07:55:31,046 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;@12e659a1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:55:31,046 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 07:55:31,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:55:31,049 INFO L124 PetriNetUnfolderBase]: 9/40 cut-off events. [2023-08-26 07:55:31,049 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:55:31,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:31,049 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-26 07:55:31,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:55:31,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:31,050 INFO L85 PathProgramCache]: Analyzing trace with hash 905131913, now seen corresponding path program 1 times [2023-08-26 07:55:31,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:31,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497446356] [2023-08-26 07:55:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:31,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:31,069 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:55:31,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497446356] [2023-08-26 07:55:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497446356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:31,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:55:31,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:55:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419994436] [2023-08-26 07:55:31,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:31,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:55:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:31,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:55:31,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:55:31,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 463 [2023-08-26 07:55:31,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 131 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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:31,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:31,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 463 [2023-08-26 07:55:31,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:31,244 INFO L124 PetriNetUnfolderBase]: 420/1607 cut-off events. [2023-08-26 07:55:31,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:55:31,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1607 events. 420/1607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 11668 event pairs, 378 based on Foata normal form. 148/1566 useless extension candidates. Maximal degree in co-relation 2340. Up to 820 conditions per place. [2023-08-26 07:55:31,247 INFO L140 encePairwiseOnDemand]: 439/463 looper letters, 24 selfloop transitions, 2 changer transitions 54/111 dead transitions. [2023-08-26 07:55:31,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 111 transitions, 315 flow [2023-08-26 07:55:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:55:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:55:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2023-08-26 07:55:31,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5593952483801296 [2023-08-26 07:55:31,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 777 transitions. [2023-08-26 07:55:31,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 777 transitions. [2023-08-26 07:55:31,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:31,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 777 transitions. [2023-08-26 07:55:31,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 0 states have call successors, (0), 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:31,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 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:31,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 0 states have call successors, (0), 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:31,255 INFO L175 Difference]: Start difference. First operand has 111 places, 131 transitions, 267 flow. Second operand 3 states and 777 transitions. [2023-08-26 07:55:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 111 transitions, 315 flow [2023-08-26 07:55:31,256 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:55:31,257 INFO L231 Difference]: Finished difference. Result has 113 places, 57 transitions, 129 flow [2023-08-26 07:55:31,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, 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:55:31,258 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, 2 predicate places. [2023-08-26 07:55:31,258 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 57 transitions, 129 flow [2023-08-26 07:55:31,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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:31,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:31,259 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:31,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 07:55:31,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:55:31,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash 375555570, now seen corresponding path program 1 times [2023-08-26 07:55:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477932113] [2023-08-26 07:55:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:31,286 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:55:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477932113] [2023-08-26 07:55:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477932113] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753441029] [2023-08-26 07:55:31,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:31,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:31,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:31,288 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:55:31,303 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:55:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:31,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:55:31,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:31,394 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:55:31,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:55:31,407 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:55:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753441029] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:55:31,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:55:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:55:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375524340] [2023-08-26 07:55:31,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:55:31,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:55:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:55:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:55:31,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 463 [2023-08-26 07:55:31,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 57 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 238.57142857142858) internal successors, (1670), 7 states have internal predecessors, (1670), 0 states have call successors, (0), 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:31,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:31,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 463 [2023-08-26 07:55:31,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:31,466 INFO L124 PetriNetUnfolderBase]: 59/260 cut-off events. [2023-08-26 07:55:31,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:55:31,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 260 events. 59/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 892 event pairs, 54 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 403. Up to 136 conditions per place. [2023-08-26 07:55:31,467 INFO L140 encePairwiseOnDemand]: 460/463 looper letters, 24 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-26 07:55:31,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 199 flow [2023-08-26 07:55:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:55:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:55:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1454 transitions. [2023-08-26 07:55:31,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233981281497481 [2023-08-26 07:55:31,471 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1454 transitions. [2023-08-26 07:55:31,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1454 transitions. [2023-08-26 07:55:31,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:31,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1454 transitions. [2023-08-26 07:55:31,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 242.33333333333334) internal successors, (1454), 6 states have internal predecessors, (1454), 0 states have call successors, (0), 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:31,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 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:31,478 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 0 states have call successors, (0), 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:31,478 INFO L175 Difference]: Start difference. First operand has 113 places, 57 transitions, 129 flow. Second operand 6 states and 1454 transitions. [2023-08-26 07:55:31,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 199 flow [2023-08-26 07:55:31,479 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:55:31,480 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 161 flow [2023-08-26 07:55:31,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, 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:55:31,482 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -44 predicate places. [2023-08-26 07:55:31,482 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 161 flow [2023-08-26 07:55:31,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 238.57142857142858) internal successors, (1670), 7 states have internal predecessors, (1670), 0 states have call successors, (0), 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:31,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:31,482 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-26 07:55:31,495 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:55:31,692 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:55:31,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:55:31,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2122844617, now seen corresponding path program 2 times [2023-08-26 07:55:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475386648] [2023-08-26 07:55:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:31,747 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:55:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475386648] [2023-08-26 07:55:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475386648] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260433742] [2023-08-26 07:55:31,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:55:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:31,749 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:55:31,752 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:55:31,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:55:31,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:55:31,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:55:31,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:31,859 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:55:31,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:55:31,904 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:55:31,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260433742] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:55:31,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:55:31,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 07:55:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278307460] [2023-08-26 07:55:31,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:55:31,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:55:31,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:31,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:55:31,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 07:55:31,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 463 [2023-08-26 07:55:31,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 161 flow. Second operand has 13 states, 13 states have (on average 238.30769230769232) internal successors, (3098), 13 states have internal predecessors, (3098), 0 states have call successors, (0), 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:31,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:31,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 463 [2023-08-26 07:55:31,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:31,972 INFO L124 PetriNetUnfolderBase]: 59/266 cut-off events. [2023-08-26 07:55:31,972 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 07:55:31,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 266 events. 59/266 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 892 event pairs, 54 based on Foata normal form. 6/236 useless extension candidates. Maximal degree in co-relation 394. Up to 136 conditions per place. [2023-08-26 07:55:31,973 INFO L140 encePairwiseOnDemand]: 460/463 looper letters, 24 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2023-08-26 07:55:31,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 66 transitions, 267 flow [2023-08-26 07:55:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:55:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:55:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2885 transitions. [2023-08-26 07:55:31,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192584593232541 [2023-08-26 07:55:31,979 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2885 transitions. [2023-08-26 07:55:31,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2885 transitions. [2023-08-26 07:55:31,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:31,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2885 transitions. [2023-08-26 07:55:31,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 240.41666666666666) internal successors, (2885), 12 states have internal predecessors, (2885), 0 states have call successors, (0), 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:31,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 463.0) internal successors, (6019), 13 states have internal predecessors, (6019), 0 states have call successors, (0), 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:31,992 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 463.0) internal successors, (6019), 13 states have internal predecessors, (6019), 0 states have call successors, (0), 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:31,992 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 161 flow. Second operand 12 states and 2885 transitions. [2023-08-26 07:55:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 66 transitions, 267 flow [2023-08-26 07:55:31,993 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:55:31,994 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 231 flow [2023-08-26 07:55:31,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, 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:55:31,994 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -28 predicate places. [2023-08-26 07:55:31,994 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 231 flow [2023-08-26 07:55:31,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 238.30769230769232) internal successors, (3098), 13 states have internal predecessors, (3098), 0 states have call successors, (0), 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:31,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:31,995 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-26 07:55:32,002 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:55:32,200 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:55:32,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 07:55:32,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1514432809, now seen corresponding path program 3 times [2023-08-26 07:55:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903124897] [2023-08-26 07:55:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 07:55:32,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 07:55:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 07:55:32,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 07:55:32,251 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 07:55:32,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 07:55:32,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 07:55:32,252 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-26 07:55:32,252 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 07:55:32,253 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 07:55:32,253 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 07:55:32,294 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 07:55:32,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 389 transitions, 796 flow [2023-08-26 07:55:32,351 INFO L124 PetriNetUnfolderBase]: 80/652 cut-off events. [2023-08-26 07:55:32,351 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-08-26 07:55:32,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 652 events. 80/652 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3285 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 396. Up to 12 conditions per place. [2023-08-26 07:55:32,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 389 transitions, 796 flow [2023-08-26 07:55:32,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 389 transitions, 796 flow [2023-08-26 07:55:32,361 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:55:32,362 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 346 places, 389 transitions, 796 flow [2023-08-26 07:55:32,362 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 346 places, 389 transitions, 796 flow [2023-08-26 07:55:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 389 transitions, 796 flow [2023-08-26 07:55:32,430 INFO L124 PetriNetUnfolderBase]: 80/652 cut-off events. [2023-08-26 07:55:32,431 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-08-26 07:55:32,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 652 events. 80/652 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3285 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 396. Up to 12 conditions per place. [2023-08-26 07:55:32,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 79352 [2023-08-26 07:55:35,769 INFO L134 LiptonReduction]: Checked pairs total: 270080 [2023-08-26 07:55:35,769 INFO L136 LiptonReduction]: Total number of compositions: 255 [2023-08-26 07:55:35,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:55:35,771 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;@12e659a1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:55:35,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-26 07:55:35,776 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:55:35,777 INFO L124 PetriNetUnfolderBase]: 14/80 cut-off events. [2023-08-26 07:55:35,777 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:55:35,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:35,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:35,777 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:55:35,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1208753874, now seen corresponding path program 1 times [2023-08-26 07:55:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644332307] [2023-08-26 07:55:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:35,815 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:55:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644332307] [2023-08-26 07:55:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644332307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:35,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:55:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:55:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100392255] [2023-08-26 07:55:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:35,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:55:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:55:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:55:35,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 644 [2023-08-26 07:55:35,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 196 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 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:35,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:35,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 644 [2023-08-26 07:55:35,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:38,695 INFO L124 PetriNetUnfolderBase]: 17084/40028 cut-off events. [2023-08-26 07:55:38,695 INFO L125 PetriNetUnfolderBase]: For 244/320 co-relation queries the response was YES. [2023-08-26 07:55:38,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64911 conditions, 40028 events. 17084/40028 cut-off events. For 244/320 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 444094 event pairs, 15876 based on Foata normal form. 4763/39943 useless extension candidates. Maximal degree in co-relation 22729. Up to 24758 conditions per place. [2023-08-26 07:55:38,916 INFO L140 encePairwiseOnDemand]: 610/644 looper letters, 65 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2023-08-26 07:55:38,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 166 transitions, 484 flow [2023-08-26 07:55:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:55:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:55:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions. [2023-08-26 07:55:38,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5667701863354038 [2023-08-26 07:55:38,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1095 transitions. [2023-08-26 07:55:38,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1095 transitions. [2023-08-26 07:55:38,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:38,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1095 transitions. [2023-08-26 07:55:38,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 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:38,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 644.0) internal successors, (2576), 4 states have internal predecessors, (2576), 0 states have call successors, (0), 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:38,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 644.0) internal successors, (2576), 4 states have internal predecessors, (2576), 0 states have call successors, (0), 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:38,924 INFO L175 Difference]: Start difference. First operand has 164 places, 196 transitions, 410 flow. Second operand 3 states and 1095 transitions. [2023-08-26 07:55:38,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 166 transitions, 484 flow [2023-08-26 07:55:38,926 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:55:38,927 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 360 flow [2023-08-26 07:55:38,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, 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:55:38,928 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 3 predicate places. [2023-08-26 07:55:38,928 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 360 flow [2023-08-26 07:55:38,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 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:38,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:38,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:38,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 07:55:38,929 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:55:38,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1931739716, now seen corresponding path program 1 times [2023-08-26 07:55:38,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:38,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040642245] [2023-08-26 07:55:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:38,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:38,959 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:55:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040642245] [2023-08-26 07:55:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040642245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855230117] [2023-08-26 07:55:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:38,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:38,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:38,961 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:55:38,986 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:55:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:39,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:55:39,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:39,069 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:55:39,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:55:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855230117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:39,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:55:39,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:55:39,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368541199] [2023-08-26 07:55:39,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:39,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:55:39,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:39,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:55:39,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:55:39,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 644 [2023-08-26 07:55:39,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 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:39,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:39,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 644 [2023-08-26 07:55:39,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:41,845 INFO L124 PetriNetUnfolderBase]: 17118/40256 cut-off events. [2023-08-26 07:55:41,845 INFO L125 PetriNetUnfolderBase]: For 198/230 co-relation queries the response was YES. [2023-08-26 07:55:41,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65128 conditions, 40256 events. 17118/40256 cut-off events. For 198/230 co-relation queries the response was YES. Maximal size of possible extension queue 1151. Compared 448626 event pairs, 14022 based on Foata normal form. 0/35360 useless extension candidates. Maximal degree in co-relation 65115. Up to 24720 conditions per place. [2023-08-26 07:55:42,097 INFO L140 encePairwiseOnDemand]: 641/644 looper letters, 85 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-08-26 07:55:42,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 186 transitions, 574 flow [2023-08-26 07:55:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:55:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:55:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions. [2023-08-26 07:55:42,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5605590062111802 [2023-08-26 07:55:42,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1083 transitions. [2023-08-26 07:55:42,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1083 transitions. [2023-08-26 07:55:42,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:42,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1083 transitions. [2023-08-26 07:55:42,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 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:42,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 644.0) internal successors, (2576), 4 states have internal predecessors, (2576), 0 states have call successors, (0), 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:42,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 644.0) internal successors, (2576), 4 states have internal predecessors, (2576), 0 states have call successors, (0), 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:42,106 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 360 flow. Second operand 3 states and 1083 transitions. [2023-08-26 07:55:42,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 186 transitions, 574 flow [2023-08-26 07:55:42,107 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:55:42,109 INFO L231 Difference]: Finished difference. Result has 169 places, 167 transitions, 368 flow [2023-08-26 07:55:42,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, 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:55:42,111 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 5 predicate places. [2023-08-26 07:55:42,111 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 167 transitions, 368 flow [2023-08-26 07:55:42,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 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:42,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:42,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:42,118 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:55:42,317 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:55:42,317 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:55:42,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash -853701027, now seen corresponding path program 1 times [2023-08-26 07:55:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977490441] [2023-08-26 07:55:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:42,364 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:55:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977490441] [2023-08-26 07:55:42,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977490441] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:42,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620329788] [2023-08-26 07:55:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:42,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:42,366 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:55:42,369 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:55:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:42,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:55:42,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:42,486 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:55:42,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:55:42,497 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:55:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620329788] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:55:42,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:55:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:55:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092266697] [2023-08-26 07:55:42,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:55:42,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:55:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:55:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:55:42,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 644 [2023-08-26 07:55:42,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 167 transitions, 368 flow. Second operand has 7 states, 7 states have (on average 333.85714285714283) internal successors, (2337), 7 states have internal predecessors, (2337), 0 states have call successors, (0), 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:42,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:42,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 644 [2023-08-26 07:55:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:45,405 INFO L124 PetriNetUnfolderBase]: 17118/40432 cut-off events. [2023-08-26 07:55:45,405 INFO L125 PetriNetUnfolderBase]: For 956/972 co-relation queries the response was YES. [2023-08-26 07:55:45,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66089 conditions, 40432 events. 17118/40432 cut-off events. For 956/972 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 451628 event pairs, 15876 based on Foata normal form. 3/35873 useless extension candidates. Maximal degree in co-relation 66061. Up to 24740 conditions per place. [2023-08-26 07:55:45,622 INFO L140 encePairwiseOnDemand]: 641/644 looper letters, 66 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2023-08-26 07:55:45,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 522 flow [2023-08-26 07:55:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:55:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:55:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2065 transitions. [2023-08-26 07:55:45,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344202898550725 [2023-08-26 07:55:45,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2065 transitions. [2023-08-26 07:55:45,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2065 transitions. [2023-08-26 07:55:45,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:45,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2065 transitions. [2023-08-26 07:55:45,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 344.1666666666667) internal successors, (2065), 6 states have internal predecessors, (2065), 0 states have call successors, (0), 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:45,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 644.0) internal successors, (4508), 7 states have internal predecessors, (4508), 0 states have call successors, (0), 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:45,638 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 644.0) internal successors, (4508), 7 states have internal predecessors, (4508), 0 states have call successors, (0), 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:45,638 INFO L175 Difference]: Start difference. First operand has 169 places, 167 transitions, 368 flow. Second operand 6 states and 2065 transitions. [2023-08-26 07:55:45,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 522 flow [2023-08-26 07:55:45,641 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:55:45,643 INFO L231 Difference]: Finished difference. Result has 176 places, 170 transitions, 402 flow [2023-08-26 07:55:45,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, 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:55:45,644 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 12 predicate places. [2023-08-26 07:55:45,644 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 170 transitions, 402 flow [2023-08-26 07:55:45,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 333.85714285714283) internal successors, (2337), 7 states have internal predecessors, (2337), 0 states have call successors, (0), 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:45,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:45,645 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:45,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 07:55:45,852 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:55:45,853 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:55:45,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1193300850, now seen corresponding path program 2 times [2023-08-26 07:55:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:45,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227924028] [2023-08-26 07:55:45,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:45,933 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:45,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227924028] [2023-08-26 07:55:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227924028] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047506448] [2023-08-26 07:55:45,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:55:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:45,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:45,935 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:55:45,945 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:55:46,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:55:46,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:55:46,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 07:55:46,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:46,053 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:55:46,065 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:55:46,088 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:55:46,088 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:55:46,120 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:55:46,120 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:55:46,140 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:55:46,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:55:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047506448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:55:46,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:55:46,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 07:55:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611176875] [2023-08-26 07:55:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:55:46,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:55:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:46,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:55:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:55:46,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 644 [2023-08-26 07:55:46,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 170 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 238.16666666666666) internal successors, (1429), 6 states have internal predecessors, (1429), 0 states have call successors, (0), 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:46,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:46,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 644 [2023-08-26 07:55:46,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:17,288 INFO L124 PetriNetUnfolderBase]: 285240/437163 cut-off events. [2023-08-26 07:56:17,288 INFO L125 PetriNetUnfolderBase]: For 5260/5260 co-relation queries the response was YES. [2023-08-26 07:56:18,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870553 conditions, 437163 events. 285240/437163 cut-off events. For 5260/5260 co-relation queries the response was YES. Maximal size of possible extension queue 4826. Compared 3779494 event pairs, 148324 based on Foata normal form. 0/372437 useless extension candidates. Maximal degree in co-relation 870517. Up to 292738 conditions per place. [2023-08-26 07:56:19,597 INFO L140 encePairwiseOnDemand]: 607/644 looper letters, 491 selfloop transitions, 82 changer transitions 0/590 dead transitions. [2023-08-26 07:56:19,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 590 transitions, 2447 flow [2023-08-26 07:56:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:56:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:56:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1983 transitions. [2023-08-26 07:56:19,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131987577639752 [2023-08-26 07:56:19,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1983 transitions. [2023-08-26 07:56:19,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1983 transitions. [2023-08-26 07:56:19,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:19,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1983 transitions. [2023-08-26 07:56:19,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.5) internal successors, (1983), 6 states have internal predecessors, (1983), 0 states have call successors, (0), 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,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 644.0) internal successors, (4508), 7 states have internal predecessors, (4508), 0 states have call successors, (0), 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,611 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 644.0) internal successors, (4508), 7 states have internal predecessors, (4508), 0 states have call successors, (0), 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,611 INFO L175 Difference]: Start difference. First operand has 176 places, 170 transitions, 402 flow. Second operand 6 states and 1983 transitions. [2023-08-26 07:56:19,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 590 transitions, 2447 flow [2023-08-26 07:56:19,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 590 transitions, 2433 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:56:19,620 INFO L231 Difference]: Finished difference. Result has 185 places, 249 transitions, 942 flow [2023-08-26 07:56:19,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, 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:56:19,621 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 21 predicate places. [2023-08-26 07:56:19,621 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 249 transitions, 942 flow [2023-08-26 07:56:19,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.16666666666666) internal successors, (1429), 6 states have internal predecessors, (1429), 0 states have call successors, (0), 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,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:19,622 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:19,631 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:56:19,827 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:56:19,828 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:56:19,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1193300444, now seen corresponding path program 1 times [2023-08-26 07:56:19,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:19,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73148753] [2023-08-26 07:56:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:19,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:19,900 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:56:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73148753] [2023-08-26 07:56:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73148753] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652823005] [2023-08-26 07:56:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:19,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:19,902 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:56:19,905 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:56:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:20,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:56:20,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:20,040 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:56:20,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:20,087 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:56:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652823005] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:20,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:20,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 07:56:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941103807] [2023-08-26 07:56:20,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:20,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:56:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:56:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 07:56:20,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 644 [2023-08-26 07:56:20,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 249 transitions, 942 flow. Second operand has 13 states, 13 states have (on average 333.53846153846155) internal successors, (4336), 13 states have internal predecessors, (4336), 0 states have call successors, (0), 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:20,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:20,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 644 [2023-08-26 07:56:20,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:27,885 INFO L124 PetriNetUnfolderBase]: 42432/94283 cut-off events. [2023-08-26 07:56:27,885 INFO L125 PetriNetUnfolderBase]: For 20760/22292 co-relation queries the response was YES. [2023-08-26 07:56:28,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195456 conditions, 94283 events. 42432/94283 cut-off events. For 20760/22292 co-relation queries the response was YES. Maximal size of possible extension queue 2295. Compared 1098298 event pairs, 27590 based on Foata normal form. 529/85400 useless extension candidates. Maximal degree in co-relation 195398. Up to 50010 conditions per place. [2023-08-26 07:56:28,748 INFO L140 encePairwiseOnDemand]: 641/644 looper letters, 83 selfloop transitions, 11 changer transitions 0/255 dead transitions. [2023-08-26 07:56:28,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 255 transitions, 1166 flow [2023-08-26 07:56:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:56:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:56:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4066 transitions. [2023-08-26 07:56:28,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5261387163561076 [2023-08-26 07:56:28,754 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4066 transitions. [2023-08-26 07:56:28,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4066 transitions. [2023-08-26 07:56:28,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:28,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4066 transitions. [2023-08-26 07:56:28,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 338.8333333333333) internal successors, (4066), 12 states have internal predecessors, (4066), 0 states have call successors, (0), 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:28,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 644.0) internal successors, (8372), 13 states have internal predecessors, (8372), 0 states have call successors, (0), 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:28,766 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 644.0) internal successors, (8372), 13 states have internal predecessors, (8372), 0 states have call successors, (0), 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:28,766 INFO L175 Difference]: Start difference. First operand has 185 places, 249 transitions, 942 flow. Second operand 12 states and 4066 transitions. [2023-08-26 07:56:28,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 255 transitions, 1166 flow [2023-08-26 07:56:29,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 255 transitions, 1166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:56:29,063 INFO L231 Difference]: Finished difference. Result has 202 places, 255 transitions, 1026 flow [2023-08-26 07:56:29,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, 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:56:29,064 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 38 predicate places. [2023-08-26 07:56:29,064 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 255 transitions, 1026 flow [2023-08-26 07:56:29,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 333.53846153846155) internal successors, (4336), 13 states have internal predecessors, (4336), 0 states have call successors, (0), 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:29,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:29,065 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:29,071 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:56:29,270 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:56:29,271 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:56:29,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -656667708, now seen corresponding path program 2 times [2023-08-26 07:56:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:29,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814445504] [2023-08-26 07:56:29,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:29,520 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:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814445504] [2023-08-26 07:56:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814445504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:56:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:56:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:56:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668419095] [2023-08-26 07:56:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:56:29,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:56:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:56:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:56:29,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 644 [2023-08-26 07:56:29,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 255 transitions, 1026 flow. Second operand has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 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:29,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:29,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 644 [2023-08-26 07:56:29,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:58,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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)), 113#L945-41true, Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:58,259 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is not cut-off event [2023-08-26 07:56:58,259 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-08-26 07:56:58,259 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-08-26 07:56:58,259 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is not cut-off event [2023-08-26 07:56:58,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 533#(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: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), 113#L945-41true, Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), 147#L945-18true, Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:58,259 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,259 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,259 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,259 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), 113#L945-41true, Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:58,282 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), 113#L945-41true, Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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)), 178#L956-16true]) [2023-08-26 07:56:58,283 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,283 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:58,284 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,284 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,284 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,284 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:58,285 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,285 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,285 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,285 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-08-26 07:56:58,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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)), 113#L945-41true, Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:58,980 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,980 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,980 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,980 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:58,981 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,981 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,981 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,981 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,982 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:56:58,982 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,982 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,982 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:58,982 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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)), 178#L956-16true]) [2023-08-26 07:56:59,001 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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)), 178#L956-16true]) [2023-08-26 07:56:59,001 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,001 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 533#(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: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,002 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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)), 178#L956-16true]) [2023-08-26 07:56:59,002 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,002 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 533#(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: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,003 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, 178#L956-16true, Black: 537#(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))]) [2023-08-26 07:56:59,003 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,003 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,005 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,005 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,005 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,005 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-08-26 07:56:59,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 113#L945-41true, Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:56:59,336 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:59,336 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:56:59,336 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,336 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L956-18-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_6|} AuxVars[] AssignedVars[#race][260], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 113#L945-41true, Black: 533#(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: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 245#L956-19true, Black: 537#(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))]) [2023-08-26 07:56:59,337 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), 113#L945-41true, Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:56:59,337 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,337 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,338 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,338 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:59,354 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:59,354 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,355 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,355 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,355 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,356 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 533#(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: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:59,356 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:59,356 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,356 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,357 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,357 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,357 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,357 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,357 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,357 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,357 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is not cut-off event [2023-08-26 07:56:59,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,357 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 533#(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: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:59,358 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,358 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:59,358 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,359 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,359 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,359 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,359 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), 147#L945-18true, Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:59,361 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,361 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,361 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,361 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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)), 178#L956-16true]) [2023-08-26 07:56:59,387 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,387 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,387 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,387 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,387 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1318] L956-16-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_4|} AuxVars[] AssignedVars[#race][221], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, 207#L956-17true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:56:59,388 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, t_funThread2of2ForFork0InUse, 222#L945-21true, 178#L956-16true, Black: 537#(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))]) [2023-08-26 07:56:59,388 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,388 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L956-18-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_6|} AuxVars[] AssignedVars[#race][260], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 245#L956-19true, Black: 537#(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))]) [2023-08-26 07:56:59,685 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 161#t_funErr3ASSERT_VIOLATIONDATA_RACEtrue, 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:56:59,685 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,685 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,686 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:59,686 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,686 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,686 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,686 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L956-18-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_6|} AuxVars[] AssignedVars[#race][260], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 245#L956-19true, Black: 537#(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))]) [2023-08-26 07:56:59,686 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 5#L945-44true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 222#L945-21true, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:56:59,687 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,687 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:59,698 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,698 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,698 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,698 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1337] L956-17-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_5|} AuxVars[] AssignedVars[#race][244], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 87#L945-19true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, t_funThread2of2ForFork0InUse, Black: 537#(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)), 287#L956-18true]) [2023-08-26 07:56:59,699 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, 207#L956-17true, t_funThread2of2ForFork0InUse, 222#L945-21true, Black: 537#(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))]) [2023-08-26 07:56:59,699 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:56:59,699 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-08-26 07:57:00,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1394] L956-18-->L956-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~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#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~nondet55#1=|v_ULTIMATE.start_main_#t~nondet55#1_6|} AuxVars[] AssignedVars[#race][260], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, 87#L945-19true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, 245#L956-19true, t_funThread2of2ForFork0InUse, Black: 537#(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))]) [2023-08-26 07:57:00,231 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,231 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,231 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,231 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1716] L945-19-->L945-21: Formula: (let ((.cse0 (select |v_#race_251| |v_t_funThread2of2ForFork0_~p~0#1.base_93|))) (and (= (select .cse0 (+ |v_t_funThread2of2ForFork0_~p~0#1.offset_93| 1)) |v_t_funThread2of2ForFork0_#t~nondet38#1_21|) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 3 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))) (= |v_t_funThread2of2ForFork0_#t~nondet38#1_21| (select .cse0 (+ 2 |v_t_funThread2of2ForFork0_~p~0#1.offset_93|))))) InVars {#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|} OutVars{#race=|v_#race_251|, t_funThread2of2ForFork0_#t~nondet38#1=|v_t_funThread2of2ForFork0_#t~nondet38#1_21|, t_funThread2of2ForFork0_~p~0#1.base=|v_t_funThread2of2ForFork0_~p~0#1.base_93|, t_funThread2of2ForFork0_~p~0#1.offset=|v_t_funThread2of2ForFork0_~p~0#1.offset_93|, t_funThread2of2ForFork0_#t~mem36#1=|v_t_funThread2of2ForFork0_#t~mem36#1_9|} AuxVars[] AssignedVars[t_funThread2of2ForFork0_#t~mem36#1][318], [Black: 397#(<= |ULTIMATE.start_main_~i~1#1| 1), Black: 529#(= (select (select |#race| |t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0), Black: 351#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 474#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 533#(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: 478#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 541#(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)), 394#true, Black: 367#(<= |ULTIMATE.start_main_~i~3#1| 0), 664#true, 548#true, Black: 648#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 652#(< |ULTIMATE.start_main_~i~1#1| 7), Black: 656#(< |ULTIMATE.start_main_~i~1#1| 6), Black: 640#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 644#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 554#(<= |ULTIMATE.start_main_~i~1#1| 4), 483#true, t_funThread1of2ForFork0InUse, 31#L945-48true, t_funThread2of2ForFork0InUse, 222#L945-21true, 287#L956-18true, Black: 537#(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))]) [2023-08-26 07:57:00,232 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,232 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,232 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:57:00,232 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-08-26 07:57:04,837 INFO L124 PetriNetUnfolderBase]: 229899/392331 cut-off events. [2023-08-26 07:57:04,837 INFO L125 PetriNetUnfolderBase]: For 125647/126437 co-relation queries the response was YES. [2023-08-26 07:57:07,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909461 conditions, 392331 events. 229899/392331 cut-off events. For 125647/126437 co-relation queries the response was YES. Maximal size of possible extension queue 5955. Compared 4015112 event pairs, 74013 based on Foata normal form. 0/350163 useless extension candidates. Maximal degree in co-relation 909378. Up to 246893 conditions per place. [2023-08-26 07:57:08,683 INFO L140 encePairwiseOnDemand]: 633/644 looper letters, 621 selfloop transitions, 34 changer transitions 6/723 dead transitions. [2023-08-26 07:57:08,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 723 transitions, 3727 flow [2023-08-26 07:57:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 07:57:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 07:57:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2882 transitions. [2023-08-26 07:57:08,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40683229813664595 [2023-08-26 07:57:08,687 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2882 transitions. [2023-08-26 07:57:08,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2882 transitions. [2023-08-26 07:57:08,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:08,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2882 transitions. [2023-08-26 07:57:08,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 262.0) internal successors, (2882), 11 states have internal predecessors, (2882), 0 states have call successors, (0), 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:08,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 644.0) internal successors, (7728), 12 states have internal predecessors, (7728), 0 states have call successors, (0), 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:08,697 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 644.0) internal successors, (7728), 12 states have internal predecessors, (7728), 0 states have call successors, (0), 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:08,697 INFO L175 Difference]: Start difference. First operand has 202 places, 255 transitions, 1026 flow. Second operand 11 states and 2882 transitions. [2023-08-26 07:57:08,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 723 transitions, 3727 flow [2023-08-26 07:57:24,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 723 transitions, 3679 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:57:24,173 INFO L231 Difference]: Finished difference. Result has 214 places, 292 transitions, 1222 flow [2023-08-26 07:57:24,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, 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=11, PETRI_FLOW=1222, PETRI_PLACES=214, PETRI_TRANSITIONS=292} [2023-08-26 07:57:24,173 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 50 predicate places. [2023-08-26 07:57:24,173 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 292 transitions, 1222 flow [2023-08-26 07:57:24,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 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:24,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:24,174 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:57:24,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 07:57:24,174 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:57:24,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 176743370, now seen corresponding path program 1 times [2023-08-26 07:57:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029492210] [2023-08-26 07:57:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:24,219 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:57:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029492210] [2023-08-26 07:57:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029492210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854493056] [2023-08-26 07:57:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:24,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:24,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:24,221 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:57:24,247 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:57:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:24,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:57:24,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:24,362 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:57:24,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:24,376 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:57:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854493056] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:24,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 07:57:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019252254] [2023-08-26 07:57:24,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:24,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:57:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:57:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:57:24,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 644 [2023-08-26 07:57:24,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 292 transitions, 1222 flow. Second operand has 7 states, 7 states have (on average 334.57142857142856) internal successors, (2342), 7 states have internal predecessors, (2342), 0 states have call successors, (0), 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:24,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:24,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 644 [2023-08-26 07:57:24,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:25,312 INFO L124 PetriNetUnfolderBase]: 4126/9937 cut-off events. [2023-08-26 07:57:25,312 INFO L125 PetriNetUnfolderBase]: For 8016/8312 co-relation queries the response was YES. [2023-08-26 07:57:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24334 conditions, 9937 events. 4126/9937 cut-off events. For 8016/8312 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 87033 event pairs, 903 based on Foata normal form. 961/10249 useless extension candidates. Maximal degree in co-relation 24267. Up to 4248 conditions per place. [2023-08-26 07:57:25,374 INFO L140 encePairwiseOnDemand]: 641/644 looper letters, 150 selfloop transitions, 3 changer transitions 0/255 dead transitions. [2023-08-26 07:57:25,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 255 transitions, 1380 flow [2023-08-26 07:57:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 07:57:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 07:57:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1761 transitions. [2023-08-26 07:57:25,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5468944099378882 [2023-08-26 07:57:25,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1761 transitions. [2023-08-26 07:57:25,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1761 transitions. [2023-08-26 07:57:25,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:25,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1761 transitions. [2023-08-26 07:57:25,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 352.2) internal successors, (1761), 5 states have internal predecessors, (1761), 0 states have call successors, (0), 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:25,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 644.0) internal successors, (3864), 6 states have internal predecessors, (3864), 0 states have call successors, (0), 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:25,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 644.0) internal successors, (3864), 6 states have internal predecessors, (3864), 0 states have call successors, (0), 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:25,381 INFO L175 Difference]: Start difference. First operand has 214 places, 292 transitions, 1222 flow. Second operand 5 states and 1761 transitions. [2023-08-26 07:57:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 255 transitions, 1380 flow [2023-08-26 07:57:25,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 255 transitions, 1364 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 07:57:25,400 INFO L231 Difference]: Finished difference. Result has 154 places, 178 transitions, 761 flow [2023-08-26 07:57:25,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=761, PETRI_PLACES=154, PETRI_TRANSITIONS=178} [2023-08-26 07:57:25,401 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -10 predicate places. [2023-08-26 07:57:25,401 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 178 transitions, 761 flow [2023-08-26 07:57:25,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 334.57142857142856) internal successors, (2342), 7 states have internal predecessors, (2342), 0 states have call successors, (0), 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:25,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:25,401 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:57:25,406 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:57:25,605 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:57:25,605 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:57:25,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 718488812, now seen corresponding path program 1 times [2023-08-26 07:57:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:25,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026569844] [2023-08-26 07:57:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:25,794 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:57:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026569844] [2023-08-26 07:57:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026569844] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540866455] [2023-08-26 07:57:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:25,795 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:57:25,819 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:57:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:25,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 07:57:25,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:25,956 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:26,008 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:26,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:57:26,017 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:26,065 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:26,078 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:57:26,089 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:57:26,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:32,127 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:57:34,141 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:57:34,213 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:57:34,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540866455] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:34,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:34,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-26 07:57:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897996803] [2023-08-26 07:57:34,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:34,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:57:34,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:34,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:57:34,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=82, Unknown=4, NotChecked=38, Total=156 [2023-08-26 07:57:34,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 644 [2023-08-26 07:57:34,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 178 transitions, 761 flow. Second operand has 13 states, 13 states have (on average 232.30769230769232) internal successors, (3020), 13 states have internal predecessors, (3020), 0 states have call successors, (0), 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:34,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:34,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 644 [2023-08-26 07:57:34,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:35,847 INFO L124 PetriNetUnfolderBase]: 9050/17784 cut-off events. [2023-08-26 07:57:35,847 INFO L125 PetriNetUnfolderBase]: For 17822/17882 co-relation queries the response was YES. [2023-08-26 07:57:35,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49286 conditions, 17784 events. 9050/17784 cut-off events. For 17822/17882 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 146505 event pairs, 2027 based on Foata normal form. 88/16841 useless extension candidates. Maximal degree in co-relation 49222. Up to 8484 conditions per place. [2023-08-26 07:57:36,000 INFO L140 encePairwiseOnDemand]: 636/644 looper letters, 180 selfloop transitions, 20 changer transitions 3/265 dead transitions. [2023-08-26 07:57:36,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 265 transitions, 1492 flow [2023-08-26 07:57:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:57:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:57:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1763 transitions. [2023-08-26 07:57:36,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39108251996450755 [2023-08-26 07:57:36,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1763 transitions. [2023-08-26 07:57:36,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1763 transitions. [2023-08-26 07:57:36,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:36,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1763 transitions. [2023-08-26 07:57:36,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 251.85714285714286) internal successors, (1763), 7 states have internal predecessors, (1763), 0 states have call successors, (0), 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:36,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 644.0) internal successors, (5152), 8 states have internal predecessors, (5152), 0 states have call successors, (0), 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:36,006 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 644.0) internal successors, (5152), 8 states have internal predecessors, (5152), 0 states have call successors, (0), 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:36,006 INFO L175 Difference]: Start difference. First operand has 154 places, 178 transitions, 761 flow. Second operand 7 states and 1763 transitions. [2023-08-26 07:57:36,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 265 transitions, 1492 flow [2023-08-26 07:57:36,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 265 transitions, 1471 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 07:57:36,097 INFO L231 Difference]: Finished difference. Result has 160 places, 183 transitions, 857 flow [2023-08-26 07:57:36,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=160, PETRI_TRANSITIONS=183} [2023-08-26 07:57:36,097 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -4 predicate places. [2023-08-26 07:57:36,098 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 183 transitions, 857 flow [2023-08-26 07:57:36,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 232.30769230769232) internal successors, (3020), 13 states have internal predecessors, (3020), 0 states have call successors, (0), 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:36,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:36,098 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:57:36,104 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:57:36,298 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:57:36,299 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:57:36,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:36,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1937027259, now seen corresponding path program 1 times [2023-08-26 07:57:36,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:36,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662101742] [2023-08-26 07:57:36,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:36,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:36,514 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:57:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:36,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662101742] [2023-08-26 07:57:36,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662101742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:57:36,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:57:36,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:57:36,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540258179] [2023-08-26 07:57:36,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:57:36,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:57:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:36,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:57:36,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:57:36,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 644 [2023-08-26 07:57:36,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 183 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 238.66666666666666) internal successors, (1432), 6 states have internal predecessors, (1432), 0 states have call successors, (0), 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:36,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:36,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 644 [2023-08-26 07:57:36,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:39,298 INFO L124 PetriNetUnfolderBase]: 18072/29858 cut-off events. [2023-08-26 07:57:39,299 INFO L125 PetriNetUnfolderBase]: For 32803/32821 co-relation queries the response was YES. [2023-08-26 07:57:39,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87567 conditions, 29858 events. 18072/29858 cut-off events. For 32803/32821 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 213341 event pairs, 7900 based on Foata normal form. 0/28014 useless extension candidates. Maximal degree in co-relation 87500. Up to 18649 conditions per place. [2023-08-26 07:57:39,648 INFO L140 encePairwiseOnDemand]: 615/644 looper letters, 415 selfloop transitions, 66 changer transitions 0/494 dead transitions. [2023-08-26 07:57:39,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 494 transitions, 3399 flow [2023-08-26 07:57:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:57:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:57:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1708 transitions. [2023-08-26 07:57:39,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4420289855072464 [2023-08-26 07:57:39,650 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1708 transitions. [2023-08-26 07:57:39,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1708 transitions. [2023-08-26 07:57:39,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:39,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1708 transitions. [2023-08-26 07:57:39,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 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:39,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 644.0) internal successors, (4508), 7 states have internal predecessors, (4508), 0 states have call successors, (0), 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:39,654 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 644.0) internal successors, (4508), 7 states have internal predecessors, (4508), 0 states have call successors, (0), 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:39,654 INFO L175 Difference]: Start difference. First operand has 160 places, 183 transitions, 857 flow. Second operand 6 states and 1708 transitions. [2023-08-26 07:57:39,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 494 transitions, 3399 flow [2023-08-26 07:57:39,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 494 transitions, 3320 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-26 07:57:39,795 INFO L231 Difference]: Finished difference. Result has 167 places, 246 transitions, 1380 flow [2023-08-26 07:57:39,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1380, PETRI_PLACES=167, PETRI_TRANSITIONS=246} [2023-08-26 07:57:39,796 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 3 predicate places. [2023-08-26 07:57:39,796 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 246 transitions, 1380 flow [2023-08-26 07:57:39,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.66666666666666) internal successors, (1432), 6 states have internal predecessors, (1432), 0 states have call successors, (0), 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:39,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:39,797 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:57:39,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 07:57:39,797 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:57:39,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1937027552, now seen corresponding path program 1 times [2023-08-26 07:57:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024425893] [2023-08-26 07:57:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:40,068 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:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024425893] [2023-08-26 07:57:40,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024425893] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:40,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307160511] [2023-08-26 07:57:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:40,073 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:57:40,098 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:57:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:40,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 07:57:40,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:40,235 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:40,312 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:40,313 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:40,336 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:40,357 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:40,405 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:57:40,417 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:40,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:50,479 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:57:50,566 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:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307160511] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:50,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:50,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-08-26 07:57:50,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87046706] [2023-08-26 07:57:50,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:50,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 07:57:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:50,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 07:57:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=162, Unknown=2, NotChecked=26, Total=240 [2023-08-26 07:57:50,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 644 [2023-08-26 07:57:50,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 246 transitions, 1380 flow. Second operand has 16 states, 16 states have (on average 213.5625) internal successors, (3417), 16 states have internal predecessors, (3417), 0 states have call successors, (0), 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:50,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:50,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 644 [2023-08-26 07:57:50,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:53,215 INFO L124 PetriNetUnfolderBase]: 11909/22156 cut-off events. [2023-08-26 07:57:53,215 INFO L125 PetriNetUnfolderBase]: For 26709/27402 co-relation queries the response was YES. [2023-08-26 07:57:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67883 conditions, 22156 events. 11909/22156 cut-off events. For 26709/27402 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 177519 event pairs, 1690 based on Foata normal form. 334/21431 useless extension candidates. Maximal degree in co-relation 67814. Up to 13845 conditions per place. [2023-08-26 07:57:53,516 INFO L140 encePairwiseOnDemand]: 636/644 looper letters, 242 selfloop transitions, 19 changer transitions 10/343 dead transitions. [2023-08-26 07:57:53,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 343 transitions, 2381 flow [2023-08-26 07:57:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:57:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:57:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1635 transitions. [2023-08-26 07:57:53,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3626885536823425 [2023-08-26 07:57:53,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1635 transitions. [2023-08-26 07:57:53,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1635 transitions. [2023-08-26 07:57:53,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:57:53,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1635 transitions. [2023-08-26 07:57:53,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 233.57142857142858) internal successors, (1635), 7 states have internal predecessors, (1635), 0 states have call successors, (0), 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:53,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 644.0) internal successors, (5152), 8 states have internal predecessors, (5152), 0 states have call successors, (0), 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:53,523 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 644.0) internal successors, (5152), 8 states have internal predecessors, (5152), 0 states have call successors, (0), 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:53,523 INFO L175 Difference]: Start difference. First operand has 167 places, 246 transitions, 1380 flow. Second operand 7 states and 1635 transitions. [2023-08-26 07:57:53,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 343 transitions, 2381 flow [2023-08-26 07:57:53,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 343 transitions, 2381 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:57:53,623 INFO L231 Difference]: Finished difference. Result has 177 places, 255 transitions, 1499 flow [2023-08-26 07:57:53,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=644, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1499, PETRI_PLACES=177, PETRI_TRANSITIONS=255} [2023-08-26 07:57:53,624 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, 13 predicate places. [2023-08-26 07:57:53,624 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 255 transitions, 1499 flow [2023-08-26 07:57:53,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 213.5625) internal successors, (3417), 16 states have internal predecessors, (3417), 0 states have call successors, (0), 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:53,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:57:53,625 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:57:53,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-26 07:57:53,831 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:57:53,831 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:57:53,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:57:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash 745220502, now seen corresponding path program 1 times [2023-08-26 07:57:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:57:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608225688] [2023-08-26 07:57:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:57:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:57:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:54,107 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:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608225688] [2023-08-26 07:57:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608225688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:57:54,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:57:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:57:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542991174] [2023-08-26 07:57:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:57:54,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:57:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:54,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:57:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:57:54,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 644 [2023-08-26 07:57:54,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 255 transitions, 1499 flow. Second operand has 6 states, 6 states have (on average 237.16666666666666) internal successors, (1423), 6 states have internal predecessors, (1423), 0 states have call successors, (0), 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:54,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:54,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 644 [2023-08-26 07:57:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand