/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:22:22,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:22:22,278 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-NoLbe.epf [2023-11-30 05:22:22,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:22:22,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:22:22,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:22:22,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:22:22,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:22:22,293 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:22:22,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:22:22,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:22:22,294 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:22:22,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:22:22,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:22:22,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:22:22,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:22:22,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:22:22,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:22:22,296 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:22:22,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:22:22,296 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:22:22,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:22:22,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:22:22,297 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:22:22,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:22:22,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:22:22,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:22:22,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:22:22,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:22:22,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:22:22,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:22:22,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:22:22,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:22:22,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true 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: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 05:22:22,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:22:22,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:22:22,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:22:22,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:22:22,525 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:22:22,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-11-30 05:22:23,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:22:23,825 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:22:23,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-11-30 05:22:23,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e580ff7cf/3a03ae9ec94749c2afb74cbef6a9c642/FLAG098fb9c25 [2023-11-30 05:22:23,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e580ff7cf/3a03ae9ec94749c2afb74cbef6a9c642 [2023-11-30 05:22:23,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:22:23,857 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:22:23,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:22:23,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:22:23,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:22:23,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:22:23" (1/1) ... [2023-11-30 05:22:23,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644715d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:23, skipping insertion in model container [2023-11-30 05:22:23,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:22:23" (1/1) ... [2023-11-30 05:22:23,907 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:22:24,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:22:24,185 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:22:24,217 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:22:24,285 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:22:24,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24 WrapperNode [2023-11-30 05:22:24,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:22:24,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:22:24,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:22:24,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:22:24,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,351 INFO L138 Inliner]: procedures = 272, calls = 48, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 291 [2023-11-30 05:22:24,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:22:24,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:22:24,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:22:24,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:22:24,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:22:24,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:22:24,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:22:24,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:22:24,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (1/1) ... [2023-11-30 05:22:24,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:22:24,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:24,429 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-11-30 05:22:24,481 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-11-30 05:22:24,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:22:24,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:22:24,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:22:24,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:22:24,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:22:24,490 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 05:22:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 05:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:22:24,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:22:24,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:22:24,493 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:22:24,585 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:22:24,586 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:22:24,916 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:22:24,971 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:22:24,971 INFO L309 CfgBuilder]: Removed 35 assume(true) statements. [2023-11-30 05:22:24,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:22:24 BoogieIcfgContainer [2023-11-30 05:22:24,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:22:24,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:22:24,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:22:24,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:22:24,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:22:23" (1/3) ... [2023-11-30 05:22:24,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557f2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:22:24, skipping insertion in model container [2023-11-30 05:22:24,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:22:24" (2/3) ... [2023-11-30 05:22:24,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557f2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:22:24, skipping insertion in model container [2023-11-30 05:22:24,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:22:24" (3/3) ... [2023-11-30 05:22:24,979 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-11-30 05:22:24,991 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:22:24,991 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-30 05:22:24,991 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:22:25,057 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 05:22:25,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 311 transitions, 629 flow [2023-11-30 05:22:25,211 INFO L124 PetriNetUnfolderBase]: 78/490 cut-off events. [2023-11-30 05:22:25,211 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 05:22:25,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 490 events. 78/490 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2612 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 274. Up to 8 conditions per place. [2023-11-30 05:22:25,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 311 transitions, 629 flow [2023-11-30 05:22:25,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 311 transitions, 629 flow [2023-11-30 05:22:25,248 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:22:25,254 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e1dd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:22:25,254 INFO L363 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-30 05:22:25,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:22:25,262 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2023-11-30 05:22:25,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:22:25,262 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:25,263 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:25,263 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:25,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -229888053, now seen corresponding path program 1 times [2023-11-30 05:22:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:25,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900572336] [2023-11-30 05:22:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900572336] [2023-11-30 05:22:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900572336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:22:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:22:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384204960] [2023-11-30 05:22:25,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:25,521 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:22:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:25,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:22:25,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:22:25,553 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 311 [2023-11-30 05:22:25,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 311 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:25,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:25,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 311 [2023-11-30 05:22:25,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:25,821 INFO L124 PetriNetUnfolderBase]: 161/1612 cut-off events. [2023-11-30 05:22:25,821 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 05:22:25,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 1612 events. 161/1612 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 13610 event pairs, 120 based on Foata normal form. 381/1716 useless extension candidates. Maximal degree in co-relation 1703. Up to 305 conditions per place. [2023-11-30 05:22:25,829 INFO L140 encePairwiseOnDemand]: 267/311 looper letters, 35 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2023-11-30 05:22:25,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 265 transitions, 611 flow [2023-11-30 05:22:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:22:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:22:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2023-11-30 05:22:25,843 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8381564844587353 [2023-11-30 05:22:25,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 782 transitions. [2023-11-30 05:22:25,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 782 transitions. [2023-11-30 05:22:25,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:25,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 782 transitions. [2023-11-30 05:22:25,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:25,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:25,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:25,861 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, -7 predicate places. [2023-11-30 05:22:25,861 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 265 transitions, 611 flow [2023-11-30 05:22:25,862 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:25,862 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:25,862 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:25,862 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:22:25,862 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:25,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:25,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1577400416, now seen corresponding path program 1 times [2023-11-30 05:22:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594167093] [2023-11-30 05:22:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:25,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594167093] [2023-11-30 05:22:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594167093] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152924090] [2023-11-30 05:22:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:26,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:26,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:26,006 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-11-30 05:22:26,027 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-11-30 05:22:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:26,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 05:22:26,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:26,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:22:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:26,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152924090] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:22:26,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:22:26,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:22:26,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939409862] [2023-11-30 05:22:26,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:22:26,148 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 05:22:26,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 05:22:26,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 05:22:26,151 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 311 [2023-11-30 05:22:26,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 265 transitions, 611 flow. Second operand has 10 states, 10 states have (on average 235.1) internal successors, (2351), 10 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:26,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:26,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 311 [2023-11-30 05:22:26,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:26,381 INFO L124 PetriNetUnfolderBase]: 161/1619 cut-off events. [2023-11-30 05:22:26,381 INFO L125 PetriNetUnfolderBase]: For 180/192 co-relation queries the response was YES. [2023-11-30 05:22:26,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1619 events. 161/1619 cut-off events. For 180/192 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 13574 event pairs, 120 based on Foata normal form. 0/1342 useless extension candidates. Maximal degree in co-relation 1981. Up to 310 conditions per place. [2023-11-30 05:22:26,390 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 36 selfloop transitions, 9 changer transitions 0/272 dead transitions. [2023-11-30 05:22:26,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 272 transitions, 725 flow [2023-11-30 05:22:26,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:22:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:22:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2144 transitions. [2023-11-30 05:22:26,393 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.765987852804573 [2023-11-30 05:22:26,394 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2144 transitions. [2023-11-30 05:22:26,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2144 transitions. [2023-11-30 05:22:26,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:26,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2144 transitions. [2023-11-30 05:22:26,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 238.22222222222223) internal successors, (2144), 9 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:26,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 311.0) internal successors, (3110), 10 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:26,402 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 311.0) internal successors, (3110), 10 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:26,403 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, 1 predicate places. [2023-11-30 05:22:26,403 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 272 transitions, 725 flow [2023-11-30 05:22:26,405 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 235.1) internal successors, (2351), 10 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:26,405 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:26,405 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:26,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 05:22:26,609 WARN L482 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-11-30 05:22:26,609 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:26,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1440852160, now seen corresponding path program 2 times [2023-11-30 05:22:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361306670] [2023-11-30 05:22:26,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:26,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-30 05:22:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361306670] [2023-11-30 05:22:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361306670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:22:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:22:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509620224] [2023-11-30 05:22:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:26,691 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:22:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:22:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:22:26,694 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 311 [2023-11-30 05:22:26,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 272 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:26,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 311 [2023-11-30 05:22:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:27,149 INFO L124 PetriNetUnfolderBase]: 828/3982 cut-off events. [2023-11-30 05:22:27,150 INFO L125 PetriNetUnfolderBase]: For 1657/1669 co-relation queries the response was YES. [2023-11-30 05:22:27,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7015 conditions, 3982 events. 828/3982 cut-off events. For 1657/1669 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 41251 event pairs, 684 based on Foata normal form. 0/3396 useless extension candidates. Maximal degree in co-relation 6690. Up to 1504 conditions per place. [2023-11-30 05:22:27,171 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 84 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2023-11-30 05:22:27,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 288 transitions, 961 flow [2023-11-30 05:22:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:22:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:22:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-11-30 05:22:27,174 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7277599142550911 [2023-11-30 05:22:27,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-11-30 05:22:27,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-11-30 05:22:27,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:27,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-11-30 05:22:27,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:27,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:27,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:27,178 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, 1 predicate places. [2023-11-30 05:22:27,179 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 288 transitions, 961 flow [2023-11-30 05:22:27,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:27,179 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:27,180 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:27,180 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:22:27,180 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:27,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:27,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1440852159, now seen corresponding path program 1 times [2023-11-30 05:22:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:27,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898292459] [2023-11-30 05:22:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:27,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898292459] [2023-11-30 05:22:27,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898292459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:27,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346737843] [2023-11-30 05:22:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:27,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:27,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:27,304 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-11-30 05:22:27,355 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-11-30 05:22:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:27,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 05:22:27,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:27,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:22:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:27,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346737843] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:22:27,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:22:27,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-30 05:22:27,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674210631] [2023-11-30 05:22:27,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:22:27,520 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 05:22:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 05:22:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-30 05:22:27,526 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 311 [2023-11-30 05:22:27,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 288 transitions, 961 flow. Second operand has 18 states, 18 states have (on average 235.27777777777777) internal successors, (4235), 18 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:27,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:27,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 311 [2023-11-30 05:22:27,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:28,112 INFO L124 PetriNetUnfolderBase]: 828/4002 cut-off events. [2023-11-30 05:22:28,112 INFO L125 PetriNetUnfolderBase]: For 3307/3325 co-relation queries the response was YES. [2023-11-30 05:22:28,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7792 conditions, 4002 events. 828/4002 cut-off events. For 3307/3325 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 41194 event pairs, 684 based on Foata normal form. 0/3416 useless extension candidates. Maximal degree in co-relation 7352. Up to 1504 conditions per place. [2023-11-30 05:22:28,133 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 52 selfloop transitions, 21 changer transitions 0/308 dead transitions. [2023-11-30 05:22:28,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 308 transitions, 1219 flow [2023-11-30 05:22:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-30 05:22:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-30 05:22:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4962 transitions. [2023-11-30 05:22:28,141 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7597611391823611 [2023-11-30 05:22:28,141 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4962 transitions. [2023-11-30 05:22:28,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4962 transitions. [2023-11-30 05:22:28,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:28,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4962 transitions. [2023-11-30 05:22:28,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 236.28571428571428) internal successors, (4962), 21 states have internal predecessors, (4962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:28,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 311.0) internal successors, (6842), 22 states have internal predecessors, (6842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:28,163 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 311.0) internal successors, (6842), 22 states have internal predecessors, (6842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:28,164 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, 21 predicate places. [2023-11-30 05:22:28,164 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 308 transitions, 1219 flow [2023-11-30 05:22:28,165 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 235.27777777777777) internal successors, (4235), 18 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:28,166 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:28,166 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:28,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 05:22:28,372 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-30 05:22:28,372 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:28,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1204073215, now seen corresponding path program 2 times [2023-11-30 05:22:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:28,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623879810] [2023-11-30 05:22:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-30 05:22:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:28,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623879810] [2023-11-30 05:22:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623879810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:28,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:22:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:22:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460166917] [2023-11-30 05:22:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:28,526 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:22:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:22:28,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:22:28,527 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 311 [2023-11-30 05:22:28,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 308 transitions, 1219 flow. Second operand has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 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-11-30 05:22:28,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:28,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 311 [2023-11-30 05:22:28,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:28,987 INFO L124 PetriNetUnfolderBase]: 1223/4347 cut-off events. [2023-11-30 05:22:28,987 INFO L125 PetriNetUnfolderBase]: For 6869/6944 co-relation queries the response was YES. [2023-11-30 05:22:28,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10898 conditions, 4347 events. 1223/4347 cut-off events. For 6869/6944 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 43823 event pairs, 208 based on Foata normal form. 0/4069 useless extension candidates. Maximal degree in co-relation 10635. Up to 1871 conditions per place. [2023-11-30 05:22:29,020 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 120 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2023-11-30 05:22:29,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 346 transitions, 1693 flow [2023-11-30 05:22:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:22:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:22:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 881 transitions. [2023-11-30 05:22:29,023 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7081993569131833 [2023-11-30 05:22:29,024 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 881 transitions. [2023-11-30 05:22:29,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 881 transitions. [2023-11-30 05:22:29,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:29,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 881 transitions. [2023-11-30 05:22:29,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 220.25) internal successors, (881), 4 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:29,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:29,031 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 311.0) internal successors, (1555), 5 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:29,032 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, 24 predicate places. [2023-11-30 05:22:29,033 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 346 transitions, 1693 flow [2023-11-30 05:22:29,033 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 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-11-30 05:22:29,033 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:29,033 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:29,033 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:22:29,034 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:29,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1400398289, now seen corresponding path program 1 times [2023-11-30 05:22:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977016154] [2023-11-30 05:22:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:22:29,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977016154] [2023-11-30 05:22:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977016154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974581762] [2023-11-30 05:22:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:29,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:29,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:29,318 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-11-30 05:22:29,365 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-11-30 05:22:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:29,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-30 05:22:29,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:22:29,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:22:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:22:29,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974581762] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:22:29,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:22:29,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-11-30 05:22:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815248961] [2023-11-30 05:22:29,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:22:29,662 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 05:22:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:29,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 05:22:29,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-11-30 05:22:29,666 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 311 [2023-11-30 05:22:29,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 346 transitions, 1693 flow. Second operand has 23 states, 23 states have (on average 235.47826086956522) internal successors, (5416), 23 states have internal predecessors, (5416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:29,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:29,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 311 [2023-11-30 05:22:29,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:30,294 INFO L124 PetriNetUnfolderBase]: 1280/4453 cut-off events. [2023-11-30 05:22:30,294 INFO L125 PetriNetUnfolderBase]: For 10750/10895 co-relation queries the response was YES. [2023-11-30 05:22:30,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12263 conditions, 4453 events. 1280/4453 cut-off events. For 10750/10895 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 44109 event pairs, 1081 based on Foata normal form. 0/4147 useless extension candidates. Maximal degree in co-relation 11876. Up to 1925 conditions per place. [2023-11-30 05:22:30,315 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 74 selfloop transitions, 30 changer transitions 0/361 dead transitions. [2023-11-30 05:22:30,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 361 transitions, 2015 flow [2023-11-30 05:22:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 05:22:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-30 05:22:30,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 7073 transitions. [2023-11-30 05:22:30,325 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7580921757770632 [2023-11-30 05:22:30,325 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 7073 transitions. [2023-11-30 05:22:30,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 7073 transitions. [2023-11-30 05:22:30,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:30,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 7073 transitions. [2023-11-30 05:22:30,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 235.76666666666668) internal successors, (7073), 30 states have internal predecessors, (7073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:30,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 311.0) internal successors, (9641), 31 states have internal predecessors, (9641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:30,346 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 311.0) internal successors, (9641), 31 states have internal predecessors, (9641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:30,346 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, 53 predicate places. [2023-11-30 05:22:30,346 INFO L500 AbstractCegarLoop]: Abstraction has has 319 places, 361 transitions, 2015 flow [2023-11-30 05:22:30,348 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 235.47826086956522) internal successors, (5416), 23 states have internal predecessors, (5416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:30,348 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:30,348 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:30,355 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-11-30 05:22:30,554 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:30,555 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:30,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:30,555 INFO L85 PathProgramCache]: Analyzing trace with hash 589124732, now seen corresponding path program 2 times [2023-11-30 05:22:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892782539] [2023-11-30 05:22:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:30,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-30 05:22:30,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892782539] [2023-11-30 05:22:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892782539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039037331] [2023-11-30 05:22:30,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:22:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:30,671 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-11-30 05:22:30,673 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-11-30 05:22:30,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 05:22:30,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:22:30,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-30 05:22:30,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:30,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-30 05:22:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-30 05:22:30,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:22:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039037331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:22:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2023-11-30 05:22:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518657513] [2023-11-30 05:22:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:30,906 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:22:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:30,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:22:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:22:30,908 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 311 [2023-11-30 05:22:30,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 361 transitions, 2015 flow. Second operand has 7 states, 7 states have (on average 193.14285714285714) internal successors, (1352), 7 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:30,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:30,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 311 [2023-11-30 05:22:30,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:31,462 INFO L124 PetriNetUnfolderBase]: 1278/4509 cut-off events. [2023-11-30 05:22:31,462 INFO L125 PetriNetUnfolderBase]: For 14713/15149 co-relation queries the response was YES. [2023-11-30 05:22:31,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14354 conditions, 4509 events. 1278/4509 cut-off events. For 14713/15149 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 44895 event pairs, 199 based on Foata normal form. 24/4264 useless extension candidates. Maximal degree in co-relation 13949. Up to 1901 conditions per place. [2023-11-30 05:22:31,485 INFO L140 encePairwiseOnDemand]: 302/311 looper letters, 188 selfloop transitions, 8 changer transitions 0/432 dead transitions. [2023-11-30 05:22:31,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 432 transitions, 3049 flow [2023-11-30 05:22:31,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 05:22:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 05:22:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1712 transitions. [2023-11-30 05:22:31,488 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6881028938906752 [2023-11-30 05:22:31,488 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1712 transitions. [2023-11-30 05:22:31,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1712 transitions. [2023-11-30 05:22:31,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:31,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1712 transitions. [2023-11-30 05:22:31,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:31,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:31,493 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:31,494 INFO L307 CegarLoopForPetriNet]: 266 programPoint places, 59 predicate places. [2023-11-30 05:22:31,494 INFO L500 AbstractCegarLoop]: Abstraction has has 325 places, 432 transitions, 3049 flow [2023-11-30 05:22:31,494 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 193.14285714285714) internal successors, (1352), 7 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:31,494 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:31,494 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:31,516 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-11-30 05:22:31,719 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:31,719 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 05:22:31,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1082998436, now seen corresponding path program 1 times [2023-11-30 05:22:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682467544] [2023-11-30 05:22:31,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:22:31,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:22:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:22:31,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:22:31,761 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:22:31,761 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2023-11-30 05:22:31,762 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-11-30 05:22:31,762 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-11-30 05:22:31,762 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-11-30 05:22:31,762 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-11-30 05:22:31,763 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-11-30 05:22:31,764 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2023-11-30 05:22:31,765 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2023-11-30 05:22:31,765 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:22:31,765 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2023-11-30 05:22:31,767 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:22:31,767 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 05:22:31,793 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 05:22:31,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 344 places, 403 transitions, 822 flow [2023-11-30 05:22:31,848 INFO L124 PetriNetUnfolderBase]: 126/789 cut-off events. [2023-11-30 05:22:31,848 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:22:31,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 789 events. 126/789 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4762 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 492. Up to 12 conditions per place. [2023-11-30 05:22:31,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 403 transitions, 822 flow [2023-11-30 05:22:31,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 344 places, 403 transitions, 822 flow [2023-11-30 05:22:31,859 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:22:31,859 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e1dd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:22:31,859 INFO L363 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2023-11-30 05:22:31,861 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:22:31,861 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2023-11-30 05:22:31,861 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:22:31,861 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:31,861 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:31,861 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:22:31,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -654481141, now seen corresponding path program 1 times [2023-11-30 05:22:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503381205] [2023-11-30 05:22:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503381205] [2023-11-30 05:22:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503381205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:22:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:22:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339001653] [2023-11-30 05:22:31,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:31,878 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:22:31,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:22:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:22:31,879 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 403 [2023-11-30 05:22:31,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 403 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:31,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:31,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 403 [2023-11-30 05:22:31,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:33,286 INFO L124 PetriNetUnfolderBase]: 2887/15920 cut-off events. [2023-11-30 05:22:33,286 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-11-30 05:22:33,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20182 conditions, 15920 events. 2887/15920 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 209466 event pairs, 2376 based on Foata normal form. 5261/18705 useless extension candidates. Maximal degree in co-relation 18074. Up to 4186 conditions per place. [2023-11-30 05:22:33,403 INFO L140 encePairwiseOnDemand]: 346/403 looper letters, 45 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2023-11-30 05:22:33,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 341 transitions, 792 flow [2023-11-30 05:22:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:22:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:22:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2023-11-30 05:22:33,406 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8345740281224152 [2023-11-30 05:22:33,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2023-11-30 05:22:33,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2023-11-30 05:22:33,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:33,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2023-11-30 05:22:33,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:33,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 403.0) internal successors, (1612), 4 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:33,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 403.0) internal successors, (1612), 4 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:33,410 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, -10 predicate places. [2023-11-30 05:22:33,410 INFO L500 AbstractCegarLoop]: Abstraction has has 334 places, 341 transitions, 792 flow [2023-11-30 05:22:33,410 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:33,410 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:33,410 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:33,410 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:22:33,410 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:22:33,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -967699469, now seen corresponding path program 1 times [2023-11-30 05:22:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:33,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934532673] [2023-11-30 05:22:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:33,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:33,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934532673] [2023-11-30 05:22:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934532673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:33,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020665144] [2023-11-30 05:22:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:33,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:33,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:33,440 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-11-30 05:22:33,469 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-11-30 05:22:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:33,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 05:22:33,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:33,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:22:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020665144] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:22:33,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:22:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:22:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657368188] [2023-11-30 05:22:33,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:22:33,535 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 05:22:33,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 05:22:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 05:22:33,537 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 403 [2023-11-30 05:22:33,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 341 transitions, 792 flow. Second operand has 10 states, 10 states have (on average 303.1) internal successors, (3031), 10 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:33,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:33,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 403 [2023-11-30 05:22:33,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:35,053 INFO L124 PetriNetUnfolderBase]: 2887/15927 cut-off events. [2023-11-30 05:22:35,053 INFO L125 PetriNetUnfolderBase]: For 1737/1853 co-relation queries the response was YES. [2023-11-30 05:22:35,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24392 conditions, 15927 events. 2887/15927 cut-off events. For 1737/1853 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 209449 event pairs, 2376 based on Foata normal form. 0/13451 useless extension candidates. Maximal degree in co-relation 21917. Up to 4191 conditions per place. [2023-11-30 05:22:35,197 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 46 selfloop transitions, 9 changer transitions 0/348 dead transitions. [2023-11-30 05:22:35,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 348 transitions, 926 flow [2023-11-30 05:22:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:22:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:22:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2766 transitions. [2023-11-30 05:22:35,212 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7626137303556658 [2023-11-30 05:22:35,212 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2766 transitions. [2023-11-30 05:22:35,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2766 transitions. [2023-11-30 05:22:35,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:35,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2766 transitions. [2023-11-30 05:22:35,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 307.3333333333333) internal successors, (2766), 9 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:35,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 403.0) internal successors, (4030), 10 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:35,241 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 403.0) internal successors, (4030), 10 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:35,242 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, -2 predicate places. [2023-11-30 05:22:35,242 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 348 transitions, 926 flow [2023-11-30 05:22:35,243 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 303.1) internal successors, (3031), 10 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:35,243 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:35,243 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:35,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 05:22:35,447 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-30 05:22:35,447 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:22:35,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash -746183949, now seen corresponding path program 2 times [2023-11-30 05:22:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7547585] [2023-11-30 05:22:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:35,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-30 05:22:35,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:35,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7547585] [2023-11-30 05:22:35,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7547585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:35,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:22:35,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:22:35,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768697433] [2023-11-30 05:22:35,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:35,473 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:22:35,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:35,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:22:35,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:22:35,474 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 403 [2023-11-30 05:22:35,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 348 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:35,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:35,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 403 [2023-11-30 05:22:35,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:44,508 INFO L124 PetriNetUnfolderBase]: 31836/91889 cut-off events. [2023-11-30 05:22:44,508 INFO L125 PetriNetUnfolderBase]: For 45000/45301 co-relation queries the response was YES. [2023-11-30 05:22:44,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180421 conditions, 91889 events. 31836/91889 cut-off events. For 45000/45301 co-relation queries the response was YES. Maximal size of possible extension queue 3215. Compared 1341027 event pairs, 27090 based on Foata normal form. 0/76432 useless extension candidates. Maximal degree in co-relation 13114. Up to 43608 conditions per place. [2023-11-30 05:22:45,259 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 122 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2023-11-30 05:22:45,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 382 transitions, 1306 flow [2023-11-30 05:22:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:22:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:22:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2023-11-30 05:22:45,262 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7369727047146402 [2023-11-30 05:22:45,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 891 transitions. [2023-11-30 05:22:45,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 891 transitions. [2023-11-30 05:22:45,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:45,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 891 transitions. [2023-11-30 05:22:45,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:45,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 403.0) internal successors, (1612), 4 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:45,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 403.0) internal successors, (1612), 4 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:45,266 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, -2 predicate places. [2023-11-30 05:22:45,266 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 382 transitions, 1306 flow [2023-11-30 05:22:45,266 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:45,266 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:45,267 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:45,267 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 05:22:45,267 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:22:45,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:45,267 INFO L85 PathProgramCache]: Analyzing trace with hash -746183948, now seen corresponding path program 1 times [2023-11-30 05:22:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:45,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595179467] [2023-11-30 05:22:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:45,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595179467] [2023-11-30 05:22:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595179467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:45,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116510048] [2023-11-30 05:22:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:45,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:45,344 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-11-30 05:22:45,368 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-11-30 05:22:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:45,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 05:22:45,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:45,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:22:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:45,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116510048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:22:45,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:22:45,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-30 05:22:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459488039] [2023-11-30 05:22:45,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:22:45,531 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 05:22:45,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 05:22:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-11-30 05:22:45,535 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 403 [2023-11-30 05:22:45,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 382 transitions, 1306 flow. Second operand has 18 states, 18 states have (on average 303.27777777777777) internal successors, (5459), 18 states have internal predecessors, (5459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:45,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:45,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 403 [2023-11-30 05:22:45,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:56,019 INFO L124 PetriNetUnfolderBase]: 31836/91909 cut-off events. [2023-11-30 05:22:56,019 INFO L125 PetriNetUnfolderBase]: For 89607/90058 co-relation queries the response was YES. [2023-11-30 05:22:56,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201137 conditions, 91909 events. 31836/91909 cut-off events. For 89607/90058 co-relation queries the response was YES. Maximal size of possible extension queue 3215. Compared 1341454 event pairs, 27090 based on Foata normal form. 0/76452 useless extension candidates. Maximal degree in co-relation 15376. Up to 43608 conditions per place. [2023-11-30 05:22:56,869 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 70 selfloop transitions, 21 changer transitions 0/402 dead transitions. [2023-11-30 05:22:56,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 402 transitions, 1600 flow [2023-11-30 05:22:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-30 05:22:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-30 05:22:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6400 transitions. [2023-11-30 05:22:56,878 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7562330142975304 [2023-11-30 05:22:56,878 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6400 transitions. [2023-11-30 05:22:56,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6400 transitions. [2023-11-30 05:22:56,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:56,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6400 transitions. [2023-11-30 05:22:56,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 304.76190476190476) internal successors, (6400), 21 states have internal predecessors, (6400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:56,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 403.0) internal successors, (8866), 22 states have internal predecessors, (8866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:56,900 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 403.0) internal successors, (8866), 22 states have internal predecessors, (8866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:56,901 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, 18 predicate places. [2023-11-30 05:22:56,901 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 402 transitions, 1600 flow [2023-11-30 05:22:56,902 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 303.27777777777777) internal successors, (5459), 18 states have internal predecessors, (5459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:56,902 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:56,902 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:56,915 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-11-30 05:22:57,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:57,104 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:22:57,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1211498252, now seen corresponding path program 2 times [2023-11-30 05:22:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82572959] [2023-11-30 05:22:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-30 05:22:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:57,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82572959] [2023-11-30 05:22:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82572959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:22:57,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:22:57,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:22:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191785030] [2023-11-30 05:22:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:22:57,184 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:22:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:22:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:22:57,186 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 403 [2023-11-30 05:22:57,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 402 transitions, 1600 flow. Second operand has 4 states, 4 states have (on average 252.25) internal successors, (1009), 4 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:57,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:57,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 403 [2023-11-30 05:22:57,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:23:13,766 INFO L124 PetriNetUnfolderBase]: 60296/137859 cut-off events. [2023-11-30 05:23:13,777 INFO L125 PetriNetUnfolderBase]: For 288263/292274 co-relation queries the response was YES. [2023-11-30 05:23:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395131 conditions, 137859 events. 60296/137859 cut-off events. For 288263/292274 co-relation queries the response was YES. Maximal size of possible extension queue 4950. Compared 1883460 event pairs, 54152 based on Foata normal form. 0/126928 useless extension candidates. Maximal degree in co-relation 30410. Up to 73004 conditions per place. [2023-11-30 05:23:14,947 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 173 selfloop transitions, 4 changer transitions 0/460 dead transitions. [2023-11-30 05:23:14,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 460 transitions, 2294 flow [2023-11-30 05:23:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:23:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:23:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1153 transitions. [2023-11-30 05:23:14,953 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7152605459057072 [2023-11-30 05:23:14,953 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1153 transitions. [2023-11-30 05:23:14,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1153 transitions. [2023-11-30 05:23:14,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:23:14,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1153 transitions. [2023-11-30 05:23:14,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 288.25) internal successors, (1153), 4 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:14,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 403.0) internal successors, (2015), 5 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:14,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 403.0) internal successors, (2015), 5 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:14,957 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, 21 predicate places. [2023-11-30 05:23:14,957 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 460 transitions, 2294 flow [2023-11-30 05:23:14,957 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.25) internal successors, (1009), 4 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:14,957 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:23:14,958 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:23:14,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 05:23:14,958 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:23:14,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:23:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1699271370, now seen corresponding path program 1 times [2023-11-30 05:23:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:23:14,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732137209] [2023-11-30 05:23:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:23:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:23:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:23:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:23:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:23:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732137209] [2023-11-30 05:23:15,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732137209] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:23:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738545466] [2023-11-30 05:23:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:23:15,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:23:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:23:15,121 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-11-30 05:23:15,127 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-11-30 05:23:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:23:15,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-30 05:23:15,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:23:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:23:15,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:23:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-30 05:23:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738545466] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:23:15,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:23:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-11-30 05:23:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911278257] [2023-11-30 05:23:15,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:23:15,413 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 05:23:15,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:23:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 05:23:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-11-30 05:23:15,418 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 403 [2023-11-30 05:23:15,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 460 transitions, 2294 flow. Second operand has 23 states, 23 states have (on average 303.4782608695652) internal successors, (6980), 23 states have internal predecessors, (6980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:15,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:23:15,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 403 [2023-11-30 05:23:15,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:23:32,870 INFO L124 PetriNetUnfolderBase]: 60295/137862 cut-off events. [2023-11-30 05:23:32,871 INFO L125 PetriNetUnfolderBase]: For 425284/429280 co-relation queries the response was YES. [2023-11-30 05:23:33,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429992 conditions, 137862 events. 60295/137862 cut-off events. For 425284/429280 co-relation queries the response was YES. Maximal size of possible extension queue 4990. Compared 1882044 event pairs, 37863 based on Foata normal form. 0/126947 useless extension candidates. Maximal degree in co-relation 32737. Up to 73004 conditions per place. [2023-11-30 05:23:34,085 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 100 selfloop transitions, 30 changer transitions 0/475 dead transitions. [2023-11-30 05:23:34,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 475 transitions, 2668 flow [2023-11-30 05:23:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-30 05:23:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-30 05:23:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9123 transitions. [2023-11-30 05:23:34,104 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.754590570719603 [2023-11-30 05:23:34,113 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9123 transitions. [2023-11-30 05:23:34,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9123 transitions. [2023-11-30 05:23:34,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:23:34,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9123 transitions. [2023-11-30 05:23:34,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 304.1) internal successors, (9123), 30 states have internal predecessors, (9123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:34,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 403.0) internal successors, (12493), 31 states have internal predecessors, (12493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:34,135 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 403.0) internal successors, (12493), 31 states have internal predecessors, (12493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:34,135 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, 50 predicate places. [2023-11-30 05:23:34,135 INFO L500 AbstractCegarLoop]: Abstraction has has 394 places, 475 transitions, 2668 flow [2023-11-30 05:23:34,136 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 303.4782608695652) internal successors, (6980), 23 states have internal predecessors, (6980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:34,136 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:23:34,137 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:23:34,145 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-11-30 05:23:34,341 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:23:34,341 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:23:34,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:23:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1634800098, now seen corresponding path program 2 times [2023-11-30 05:23:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:23:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25189018] [2023-11-30 05:23:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:23:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:23:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:23:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-30 05:23:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:23:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25189018] [2023-11-30 05:23:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25189018] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:23:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226383924] [2023-11-30 05:23:34,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 05:23:34,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:23:34,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:23:34,481 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-11-30 05:23:34,519 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-11-30 05:23:34,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 05:23:34,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 05:23:34,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-30 05:23:34,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:23:34,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2023-11-30 05:23:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-30 05:23:34,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 05:23:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226383924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:23:34,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 05:23:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2023-11-30 05:23:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438890195] [2023-11-30 05:23:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:23:34,674 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:23:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:23:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:23:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:23:34,675 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 403 [2023-11-30 05:23:34,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 475 transitions, 2668 flow. Second operand has 7 states, 7 states have (on average 251.14285714285714) internal successors, (1758), 7 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:34,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:23:34,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 403 [2023-11-30 05:23:34,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:23:52,358 INFO L124 PetriNetUnfolderBase]: 62095/141597 cut-off events. [2023-11-30 05:23:52,358 INFO L125 PetriNetUnfolderBase]: For 589598/605285 co-relation queries the response was YES. [2023-11-30 05:23:53,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523382 conditions, 141597 events. 62095/141597 cut-off events. For 589598/605285 co-relation queries the response was YES. Maximal size of possible extension queue 4980. Compared 1923295 event pairs, 10840 based on Foata normal form. 23/132204 useless extension candidates. Maximal degree in co-relation 176174. Up to 73613 conditions per place. [2023-11-30 05:23:54,211 INFO L140 encePairwiseOnDemand]: 394/403 looper letters, 329 selfloop transitions, 10 changer transitions 0/636 dead transitions. [2023-11-30 05:23:54,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 636 transitions, 4798 flow [2023-11-30 05:23:54,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:23:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:23:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2555 transitions. [2023-11-30 05:23:54,214 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7044389302453818 [2023-11-30 05:23:54,214 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2555 transitions. [2023-11-30 05:23:54,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2555 transitions. [2023-11-30 05:23:54,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:23:54,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2555 transitions. [2023-11-30 05:23:54,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 283.8888888888889) internal successors, (2555), 9 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:54,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 403.0) internal successors, (4030), 10 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:54,219 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 403.0) internal successors, (4030), 10 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:54,219 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, 57 predicate places. [2023-11-30 05:23:54,220 INFO L500 AbstractCegarLoop]: Abstraction has has 401 places, 636 transitions, 4798 flow [2023-11-30 05:23:54,220 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 251.14285714285714) internal successors, (1758), 7 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:54,220 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:23:54,220 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:23:54,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-30 05:23:54,425 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-30 05:23:54,425 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:23:54,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:23:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1270513079, now seen corresponding path program 1 times [2023-11-30 05:23:54,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:23:54,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441100328] [2023-11-30 05:23:54,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:23:54,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:23:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:23:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-30 05:23:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:23:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441100328] [2023-11-30 05:23:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441100328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:23:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:23:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 05:23:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550625941] [2023-11-30 05:23:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:23:54,681 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 05:23:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:23:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 05:23:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-30 05:23:54,683 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 403 [2023-11-30 05:23:54,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 636 transitions, 4798 flow. Second operand has 8 states, 8 states have (on average 237.25) internal successors, (1898), 8 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:54,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:23:54,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 403 [2023-11-30 05:23:54,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:24:18,931 INFO L124 PetriNetUnfolderBase]: 66551/161793 cut-off events. [2023-11-30 05:24:18,931 INFO L125 PetriNetUnfolderBase]: For 676049/687610 co-relation queries the response was YES. [2023-11-30 05:24:19,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607915 conditions, 161793 events. 66551/161793 cut-off events. For 676049/687610 co-relation queries the response was YES. Maximal size of possible extension queue 4586. Compared 2253775 event pairs, 6976 based on Foata normal form. 8936/164207 useless extension candidates. Maximal degree in co-relation 517823. Up to 73655 conditions per place. [2023-11-30 05:24:20,768 INFO L140 encePairwiseOnDemand]: 380/403 looper letters, 626 selfloop transitions, 23 changer transitions 0/941 dead transitions. [2023-11-30 05:24:20,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 941 transitions, 9382 flow [2023-11-30 05:24:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:24:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:24:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2516 transitions. [2023-11-30 05:24:20,771 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6936862420733388 [2023-11-30 05:24:20,771 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2516 transitions. [2023-11-30 05:24:20,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2516 transitions. [2023-11-30 05:24:20,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:24:20,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2516 transitions. [2023-11-30 05:24:20,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 279.55555555555554) internal successors, (2516), 9 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:24:20,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 403.0) internal successors, (4030), 10 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:24:20,792 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 403.0) internal successors, (4030), 10 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:24:20,793 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, 60 predicate places. [2023-11-30 05:24:20,793 INFO L500 AbstractCegarLoop]: Abstraction has has 404 places, 941 transitions, 9382 flow [2023-11-30 05:24:20,793 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 237.25) internal successors, (1898), 8 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:24:20,793 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:24:20,793 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:24:20,794 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 05:24:20,794 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:24:20,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:24:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1270513080, now seen corresponding path program 1 times [2023-11-30 05:24:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:24:20,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800900841] [2023-11-30 05:24:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:24:20,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:24:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:24:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-11-30 05:24:21,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:24:21,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800900841] [2023-11-30 05:24:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800900841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:24:21,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:24:21,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 05:24:21,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975833434] [2023-11-30 05:24:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:24:21,079 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 05:24:21,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:24:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 05:24:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-30 05:24:21,080 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 403 [2023-11-30 05:24:21,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 941 transitions, 9382 flow. Second operand has 9 states, 9 states have (on average 221.33333333333334) internal successors, (1992), 9 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:24:21,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:24:21,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 403 [2023-11-30 05:24:21,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:24:22,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1314] L940-->L940-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|)) (.cse1 (+ 4 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|))) (and (= (select .cse0 .cse1) 0) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3| 0) (= (store |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5| (store .cse0 .cse1 1)) |v_#pthreadsMutex_163|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_164|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1=|v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1][99], [1616#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~3#1|)), 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 143#L954-14true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), 351#true, t_funThread2of2ForFork0InUse, 207#L940-3true, 866#true, 566#true]) [2023-11-30 05:24:22,499 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-30 05:24:22,499 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 05:24:22,499 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 05:24:22,499 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 05:24:22,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][111], [218#L956-1true, 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 177#L947-1true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 1666#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)))]) [2023-11-30 05:24:22,501 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,501 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,501 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,501 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1314] L940-->L940-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|)) (.cse1 (+ 4 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|))) (and (= (select .cse0 .cse1) 0) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3| 0) (= (store |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5| (store .cse0 .cse1 1)) |v_#pthreadsMutex_163|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_164|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1=|v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1][101], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 74#L955true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 207#L940-3true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:22,591 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,591 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,591 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,591 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-30 05:24:22,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][111], [254#L939true, 218#L956-1true, 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 1666#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)))]) [2023-11-30 05:24:22,594 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,594 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,595 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,595 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][112], [218#L956-1true, 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:22,699 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,699 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,699 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,699 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1314] L940-->L940-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|)) (.cse1 (+ 4 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|))) (and (= (select .cse0 .cse1) 0) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3| 0) (= (store |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5| (store .cse0 .cse1 1)) |v_#pthreadsMutex_163|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_164|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1=|v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1][99], [1616#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= 1 |ULTIMATE.start_main_~i~3#1|)), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 347#true, 143#L954-14true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 207#L940-3true, 866#true, 566#true]) [2023-11-30 05:24:22,711 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,712 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,712 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,712 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-30 05:24:22,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1314] L940-->L940-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|)) (.cse1 (+ 4 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|))) (and (= (select .cse0 .cse1) 0) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3| 0) (= (store |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5| (store .cse0 .cse1 1)) |v_#pthreadsMutex_163|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_164|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1=|v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1][101], [564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 74#L955true, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 351#true, 207#L940-3true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:22,804 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,804 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,804 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,804 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:22,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][112], [218#L956-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:22,931 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,931 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,931 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,931 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][143], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 177#L947-1true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 1666#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)))]) [2023-11-30 05:24:22,953 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,953 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,953 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:22,953 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:23,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][143], [254#L939true, 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 1666#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)))]) [2023-11-30 05:24:23,069 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,069 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,069 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,069 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][152], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 177#L947-1true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, 28#L957-6true, t_funThread2of2ForFork0InUse, 351#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true, 1666#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)))]) [2023-11-30 05:24:23,083 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,083 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,083 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,083 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-30 05:24:23,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][152], [254#L939true, 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, 28#L957-6true, t_funThread2of2ForFork0InUse, 351#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true, 1666#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4)))]) [2023-11-30 05:24:23,212 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-30 05:24:23,212 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:23,212 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:23,212 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:23,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][153], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 28#L957-6true, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:23,466 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-30 05:24:23,466 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:23,466 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:23,466 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:23,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][142], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:23,781 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2023-11-30 05:24:23,781 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-30 05:24:23,781 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-30 05:24:23,781 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-30 05:24:23,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][153], [564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 28#L957-6true, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:23,965 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2023-11-30 05:24:23,965 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:23,965 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:23,965 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:24,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][142], [10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:24,166 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2023-11-30 05:24:24,166 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2023-11-30 05:24:24,166 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2023-11-30 05:24:24,166 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2023-11-30 05:24:25,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1408] L941-55-->L942-2: Formula: (and (= |v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1_3| 0) (= |v_#pthreadsMutex_203| (store |v_#pthreadsMutex_204| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7| (store (select |v_#pthreadsMutex_204| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|) (+ 4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_204|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_203|, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1=|v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1_3|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1][879], [1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 74#L955true, 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1664#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 127#L947true, 204#L942-2true]) [2023-11-30 05:24:25,667 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2023-11-30 05:24:25,667 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:25,667 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:25,667 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:26,385 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][114], [1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 218#L956-1true, 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1664#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 127#L947true, 566#true]) [2023-11-30 05:24:26,385 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][155], [1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 28#L957-6true, 351#true, t_funThread2of2ForFork0InUse, 1664#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 127#L947true, 566#true]) [2023-11-30 05:24:26,386 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][145], [1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1664#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true, 127#L947true]) [2023-11-30 05:24:26,386 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 05:24:26,386 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 05:24:27,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L940-->L940-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_164| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_5|)) (.cse1 (+ 4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_5|))) (and (= (store |v_#pthreadsMutex_164| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_5| (store .cse0 .cse1 1)) |v_#pthreadsMutex_163|) (= (select .cse0 .cse1) 0) (= |v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet31#1_3| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_164|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_5|, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet31#1=|v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet31#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet31#1][214], [1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 74#L955true, 347#true, 15#L940-3true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1664#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 127#L947true, 566#true]) [2023-11-30 05:24:27,101 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-30 05:24:27,102 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:27,102 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 05:24:27,102 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:28,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1314] L940-->L940-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|)) (.cse1 (+ 4 |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|))) (and (= (select .cse0 .cse1) 0) (= |v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3| 0) (= (store |v_#pthreadsMutex_164| |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5| (store .cse0 .cse1 1)) |v_#pthreadsMutex_163|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_164|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_163|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base_5|, t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_5|, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1=|v_t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of2ForFork0_cache_entry_addref_#t~nondet31#1][911], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 74#L955true, 347#true, 15#L940-3true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 207#L940-3true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:28,766 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-30 05:24:28,766 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 05:24:28,766 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 05:24:28,766 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 05:24:28,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][910], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 218#L956-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 15#L940-3true, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:28,983 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-30 05:24:28,983 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 05:24:28,983 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 05:24:28,983 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 05:24:31,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][909], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, 15#L940-3true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:31,247 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-30 05:24:31,247 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:24:31,247 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:24:31,247 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:24:31,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1420] L941-52-->L941-41: Formula: (let ((.cse0 (select |v_#pthreadsMutex_212| |v_~#__global_lock~0.base_91|))) (and (= |v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41#1_5| 0) (= (select .cse0 |v_~#__global_lock~0.offset_91|) 0) (= (store |v_#pthreadsMutex_212| |v_~#__global_lock~0.base_91| (store .cse0 |v_~#__global_lock~0.offset_91| 1)) |v_#pthreadsMutex_211|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_212|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_91|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_91|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_211|, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41#1=|v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41#1_5|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_91|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_91|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41#1][1225], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 260#L941-41true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 74#L955true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:31,454 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-30 05:24:31,454 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 05:24:31,454 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 05:24:31,454 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 05:24:31,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][912], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 15#L940-3true, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 28#L957-6true, 351#true, t_funThread2of2ForFork0InUse, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:31,704 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:24:31,704 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:24:31,704 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:24:31,704 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:24:32,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L941-18-->L941-7: Formula: (let ((.cse0 (select |v_#pthreadsMutex_172| |v_~#__global_lock~0.base_75|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_75|) 0) (= (store |v_#pthreadsMutex_172| |v_~#__global_lock~0.base_75| (store .cse0 |v_~#__global_lock~0.offset_75| 1)) |v_#pthreadsMutex_171|) (= |v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33#1_5| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_172|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_75|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_75|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_171|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_75|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_75|, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33#1=|v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33#1_5|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33#1][1257], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 118#L941-7true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 74#L955true, 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:32,672 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is not cut-off event [2023-11-30 05:24:32,672 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-30 05:24:32,672 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-30 05:24:32,672 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2023-11-30 05:24:35,224 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][112], [218#L956-1true, 97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:35,224 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 05:24:35,224 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:35,224 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:35,224 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:35,224 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 05:24:36,667 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][112], [218#L956-1true, 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:36,667 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 05:24:36,667 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:36,667 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:36,667 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:36,667 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-30 05:24:38,499 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][142], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:38,499 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:24:38,499 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:38,499 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:38,499 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:38,499 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 05:24:39,114 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][153], [97#t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 28#L957-6true, t_funThread2of2ForFork0InUse, 351#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:39,114 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 05:24:39,114 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:39,114 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:39,114 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:39,114 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 05:24:40,005 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][142], [10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:40,005 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 05:24:40,006 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-30 05:24:40,006 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-30 05:24:40,006 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-30 05:24:40,006 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2023-11-30 05:24:40,600 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][153], [564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 147#t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), 28#L957-6true, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:40,601 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2023-11-30 05:24:40,601 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:40,601 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:40,601 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:40,601 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2023-11-30 05:24:42,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][112], [218#L956-1true, 341#t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:42,923 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2023-11-30 05:24:42,923 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 05:24:42,923 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 05:24:42,923 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 05:24:44,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][112], [9#t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 218#L956-1true, 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:44,462 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-30 05:24:44,463 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 05:24:44,463 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 05:24:44,463 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 05:24:46,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1408] L941-55-->L942-2: Formula: (and (= |v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1_3| 0) (= |v_#pthreadsMutex_203| (store |v_#pthreadsMutex_204| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7| (store (select |v_#pthreadsMutex_204| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|) (+ 4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_204|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_203|, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1=|v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1_3|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1][1530], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 254#L939true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 74#L955true, 347#true, 1646#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 204#L942-2true]) [2023-11-30 05:24:46,232 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1408] L941-55-->L942-2: Formula: (and (= |v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1_3| 0) (= |v_#pthreadsMutex_203| (store |v_#pthreadsMutex_204| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7| (store (select |v_#pthreadsMutex_204| |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|) (+ 4 |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_204|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_203|, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1=|v_t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1_3|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base_7|, t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of2ForFork0_cache_entry_addref_#t~nondet44#1][1532], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, 74#L955true, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 204#L942-2true]) [2023-11-30 05:24:46,232 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:24:46,232 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:24:46,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][142], [341#t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:24:46,233 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:24:46,233 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 05:24:46,233 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 05:24:46,233 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 05:24:46,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][153], [341#t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), 28#L957-6true, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:46,889 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 05:24:46,889 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 05:24:46,889 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 05:24:46,889 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 05:24:47,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][142], [9#t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 10#L940true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:47,880 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 05:24:47,880 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:47,880 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:47,880 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:24:48,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][153], [9#t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 10#L940true, 1668#(and (= 280 (select |#length| 4)) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.offset| 0) (= |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= |t_funThread1of2ForFork0_~i~0#1| 0) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (= |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| 0) (= 280 (select |#length| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 1648#(and (= |~#cache~0.base| 4) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_#in~entry#1.base|) 1) (= (select |#valid| 4) 1) (= (select |#valid| |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) 1)), 28#L957-6true, t_funThread2of2ForFork0InUse, 351#true, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:24:48,621 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 05:24:48,621 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 05:24:48,622 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 05:24:48,622 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 05:25:06,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][113], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 218#L956-1true, 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 184#L946-4true, 566#true]) [2023-11-30 05:25:06,618 INFO L294 olderBase$Statistics]: this new event has 198 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L956-->L956-1: Formula: (and (= |v_~#cache~0.base_4| |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|) (= (+ |v_~#cache~0.offset_3| (* |v_ULTIMATE.start_main_~i~2#1_6| 28)) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|)) InVars {~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} OutVars{~#cache~0.offset=|v_~#cache~0.offset_3|, ~#cache~0.base=|v_~#cache~0.base_4|, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_1|, ULTIMATE.start_cache_entry_addref_#in~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.base_1|, ULTIMATE.start_main_~i~2#1=|v_ULTIMATE.start_main_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_cache_entry_addref_#in~entry#1.base, ULTIMATE.start_cache_entry_addref_#in~entry#1.offset][113], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 62#L946-3true, 218#L956-1true, 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:25:06,618 INFO L294 olderBase$Statistics]: this new event has 197 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:25:06,618 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is cut-off event [2023-11-30 05:25:08,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][144], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true, 184#L946-4true]) [2023-11-30 05:25:08,696 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2023-11-30 05:25:08,696 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 05:25:08,696 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2023-11-30 05:25:08,696 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2023-11-30 05:25:08,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1151] L957-51-->L957-40: Formula: (let ((.cse0 (select |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_55|) 0) (= |v_ULTIMATE.start_main_#t~nondet60#1_7| 0) (= (store |v_#pthreadsMutex_116| |v_~#__global_lock~0.base_55| (store .cse0 |v_~#__global_lock~0.offset_55| 1)) |v_#pthreadsMutex_115|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_116|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_115|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_55|, ULTIMATE.start_main_#t~nondet60#1=|v_ULTIMATE.start_main_#t~nondet60#1_7|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_55|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet60#1][144], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 62#L946-3true, 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 324#L957-40true, 347#true, t_funThread1of2ForFork0InUse, 351#true, t_funThread2of2ForFork0InUse, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 866#true, 566#true]) [2023-11-30 05:25:08,697 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2023-11-30 05:25:08,697 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 05:25:08,697 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2023-11-30 05:25:08,697 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 05:25:09,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][154], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 28#L957-6true, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true, 184#L946-4true]) [2023-11-30 05:25:09,296 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2023-11-30 05:25:09,296 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2023-11-30 05:25:09,296 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 05:25:09,296 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is cut-off event [2023-11-30 05:25:09,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1136] L957-17-->L957-6: Formula: (let ((.cse0 (select |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27|))) (and (= |v_#pthreadsMutex_59| (store |v_#pthreadsMutex_60| |v_~#__global_lock~0.base_27| (store .cse0 |v_~#__global_lock~0.offset_27| 1))) (= |v_ULTIMATE.start_main_#t~nondet52#1_7| 0) (= (select .cse0 |v_~#__global_lock~0.offset_27|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_60|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_59|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_27|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_27|, ULTIMATE.start_main_#t~nondet52#1=|v_ULTIMATE.start_main_#t~nondet52#1_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet52#1][154], [1662#(and (= 280 (select |#length| 4)) (= |~#cache~0.base| 4) (= |~#cache~0.offset| 0) (= (select |#valid| 4) 1) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 1640#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), 62#L946-3true, 263#L947-1true, 564#(= (select |#valid| |ULTIMATE.start_main_~#t_ids~0#1.base|) 1), 863#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|) 40000)), 347#true, t_funThread1of2ForFork0InUse, 28#L957-6true, 351#true, t_funThread2of2ForFork0InUse, 866#true, 1583#(and (= |ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= 40000 (select |#length| |ULTIMATE.start_main_~#t_ids~0#1.base|))), 566#true]) [2023-11-30 05:25:09,296 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2023-11-30 05:25:09,296 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2023-11-30 05:25:09,297 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 05:25:09,297 INFO L297 olderBase$Statistics]: existing Event has 202 ancestors and is cut-off event [2023-11-30 05:25:12,240 INFO L124 PetriNetUnfolderBase]: 129055/296886 cut-off events. [2023-11-30 05:25:12,240 INFO L125 PetriNetUnfolderBase]: For 1682739/1717457 co-relation queries the response was YES. [2023-11-30 05:25:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314010 conditions, 296886 events. 129055/296886 cut-off events. For 1682739/1717457 co-relation queries the response was YES. Maximal size of possible extension queue 5568. Compared 4167042 event pairs, 36170 based on Foata normal form. 13799/296193 useless extension candidates. Maximal degree in co-relation 636712. Up to 131426 conditions per place. [2023-11-30 05:25:15,996 INFO L140 encePairwiseOnDemand]: 382/403 looper letters, 1406 selfloop transitions, 27 changer transitions 0/1684 dead transitions. [2023-11-30 05:25:15,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1684 transitions, 21254 flow [2023-11-30 05:25:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 05:25:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 05:25:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2937 transitions. [2023-11-30 05:25:16,000 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6625310173697271 [2023-11-30 05:25:16,000 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2937 transitions. [2023-11-30 05:25:16,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2937 transitions. [2023-11-30 05:25:16,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:25:16,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2937 transitions. [2023-11-30 05:25:16,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 267.0) internal successors, (2937), 11 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:16,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 403.0) internal successors, (4836), 12 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:16,021 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 403.0) internal successors, (4836), 12 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:16,021 INFO L307 CegarLoopForPetriNet]: 344 programPoint places, 65 predicate places. [2023-11-30 05:25:16,021 INFO L500 AbstractCegarLoop]: Abstraction has has 409 places, 1684 transitions, 21254 flow [2023-11-30 05:25:16,021 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 221.33333333333334) internal successors, (1992), 9 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:16,021 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:25:16,021 INFO L232 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:25:16,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 05:25:16,022 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-11-30 05:25:16,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:25:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1305678570, now seen corresponding path program 1 times [2023-11-30 05:25:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:25:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584522060] [2023-11-30 05:25:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:25:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:25:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:25:16,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:25:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:25:16,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:25:16,097 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2023-11-30 05:25:16,097 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2023-11-30 05:25:16,098 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2023-11-30 05:25:16,098 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2023-11-30 05:25:16,098 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2023-11-30 05:25:16,098 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2023-11-30 05:25:16,098 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2023-11-30 05:25:16,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2023-11-30 05:25:16,114 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2023-11-30 05:25:16,115 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2023-11-30 05:25:16,115 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 05:25:16,115 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2023-11-30 05:25:16,116 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:25:16,116 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 05:25:16,170 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 05:25:16,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 422 places, 495 transitions, 1017 flow [2023-11-30 05:25:16,268 INFO L124 PetriNetUnfolderBase]: 179/1127 cut-off events. [2023-11-30 05:25:16,268 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-30 05:25:16,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 1127 events. 179/1127 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7119 event pairs, 1 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 797. Up to 16 conditions per place. [2023-11-30 05:25:16,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 422 places, 495 transitions, 1017 flow [2023-11-30 05:25:16,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 422 places, 495 transitions, 1017 flow [2023-11-30 05:25:16,296 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:25:16,297 INFO L362 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57e1dd13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:25:16,297 INFO L363 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2023-11-30 05:25:16,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:25:16,298 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2023-11-30 05:25:16,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:25:16,298 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:25:16,298 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:25:16,298 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-30 05:25:16,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:25:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2103205045, now seen corresponding path program 1 times [2023-11-30 05:25:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:25:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261712905] [2023-11-30 05:25:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:25:16,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:25:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:25:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:25:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:25:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261712905] [2023-11-30 05:25:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261712905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:25:16,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:25:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:25:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803107170] [2023-11-30 05:25:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:25:16,312 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:25:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:25:16,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:25:16,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:25:16,313 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 495 [2023-11-30 05:25:16,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 495 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:16,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:25:16,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 495 [2023-11-30 05:25:16,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:25:33,460 INFO L124 PetriNetUnfolderBase]: 39799/158598 cut-off events. [2023-11-30 05:25:33,460 INFO L125 PetriNetUnfolderBase]: For 2317/2317 co-relation queries the response was YES. [2023-11-30 05:25:34,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211231 conditions, 158598 events. 39799/158598 cut-off events. For 2317/2317 co-relation queries the response was YES. Maximal size of possible extension queue 4345. Compared 2671887 event pairs, 33577 based on Foata normal form. 64268/200348 useless extension candidates. Maximal degree in co-relation 189024. Up to 51672 conditions per place. [2023-11-30 05:25:36,048 INFO L140 encePairwiseOnDemand]: 425/495 looper letters, 55 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2023-11-30 05:25:36,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 417 transitions, 975 flow [2023-11-30 05:25:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:25:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:25:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2023-11-30 05:25:36,050 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8323232323232324 [2023-11-30 05:25:36,050 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1236 transitions. [2023-11-30 05:25:36,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1236 transitions. [2023-11-30 05:25:36,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:25:36,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1236 transitions. [2023-11-30 05:25:36,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:36,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:36,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:36,074 INFO L307 CegarLoopForPetriNet]: 422 programPoint places, -13 predicate places. [2023-11-30 05:25:36,074 INFO L500 AbstractCegarLoop]: Abstraction has has 409 places, 417 transitions, 975 flow [2023-11-30 05:25:36,074 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:36,074 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:25:36,074 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:25:36,074 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 05:25:36,074 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-30 05:25:36,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:25:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1226950686, now seen corresponding path program 1 times [2023-11-30 05:25:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:25:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271282674] [2023-11-30 05:25:36,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:25:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:25:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:25:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:25:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:25:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271282674] [2023-11-30 05:25:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271282674] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:25:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463248114] [2023-11-30 05:25:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:25:36,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:25:36,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:25:36,133 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-11-30 05:25:36,146 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-11-30 05:25:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:25:36,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 05:25:36,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:25:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:25:36,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:25:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:25:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463248114] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:25:36,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:25:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:25:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485063108] [2023-11-30 05:25:36,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:25:36,248 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 05:25:36,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:25:36,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 05:25:36,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-30 05:25:36,250 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 495 [2023-11-30 05:25:36,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 417 transitions, 975 flow. Second operand has 10 states, 10 states have (on average 371.1) internal successors, (3711), 10 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:36,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:25:36,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 495 [2023-11-30 05:25:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:25:55,482 INFO L124 PetriNetUnfolderBase]: 39799/158605 cut-off events. [2023-11-30 05:25:55,482 INFO L125 PetriNetUnfolderBase]: For 16781/17799 co-relation queries the response was YES. [2023-11-30 05:25:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262927 conditions, 158605 events. 39799/158605 cut-off events. For 16781/17799 co-relation queries the response was YES. Maximal size of possible extension queue 4345. Compared 2672491 event pairs, 33577 based on Foata normal form. 0/136087 useless extension candidates. Maximal degree in co-relation 236067. Up to 51677 conditions per place. [2023-11-30 05:25:58,126 INFO L140 encePairwiseOnDemand]: 489/495 looper letters, 56 selfloop transitions, 9 changer transitions 0/424 dead transitions. [2023-11-30 05:25:58,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 424 transitions, 1129 flow [2023-11-30 05:25:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:25:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:25:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3388 transitions. [2023-11-30 05:25:58,129 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7604938271604939 [2023-11-30 05:25:58,129 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3388 transitions. [2023-11-30 05:25:58,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3388 transitions. [2023-11-30 05:25:58,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:25:58,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3388 transitions. [2023-11-30 05:25:58,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 376.44444444444446) internal successors, (3388), 9 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:58,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 495.0) internal successors, (4950), 10 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:58,138 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 495.0) internal successors, (4950), 10 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:58,138 INFO L307 CegarLoopForPetriNet]: 422 programPoint places, -5 predicate places. [2023-11-30 05:25:58,138 INFO L500 AbstractCegarLoop]: Abstraction has has 417 places, 424 transitions, 1129 flow [2023-11-30 05:25:58,138 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 371.1) internal successors, (3711), 10 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:58,138 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:25:58,138 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:25:58,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-30 05:25:58,342 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:25:58,343 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-30 05:25:58,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:25:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1673719170, now seen corresponding path program 2 times [2023-11-30 05:25:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:25:58,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415576150] [2023-11-30 05:25:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:25:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:25:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:25:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-30 05:25:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:25:58,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415576150] [2023-11-30 05:25:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415576150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:25:58,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:25:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:25:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905902880] [2023-11-30 05:25:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:25:58,367 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:25:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:25:58,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:25:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:25:58,368 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 495 [2023-11-30 05:25:58,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 424 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:25:58,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:25:58,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 495 [2023-11-30 05:25:58,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand