/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/pthread-ext/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:37:02,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:37:02,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:37:02,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:37:02,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:37:02,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:37:02,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:37:02,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:37:02,788 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:37:02,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:37:02,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:37:02,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:37:02,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:37:02,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:37:02,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:37:02,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:37:02,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:37:02,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:37:02,790 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:37:02,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:37:02,790 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:37:02,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:37:02,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:37:02,791 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:37:02,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:37:02,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:37:02,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:37:02,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:37:02,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:37:02,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:37:02,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:37:02,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:37:02,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:37:02,792 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 04:37:02,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:37:02,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:37:02,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:37:02,994 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:37:02,994 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:37:02,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-30 04:37:03,979 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:37:04,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:37:04,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2023-11-30 04:37:04,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfde50877/f729372bf19e4ea9ac7f5048e26578aa/FLAG502ab4f0c [2023-11-30 04:37:04,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfde50877/f729372bf19e4ea9ac7f5048e26578aa [2023-11-30 04:37:04,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:37:04,233 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:37:04,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:37:04,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:37:04,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:37:04,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79634548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04, skipping insertion in model container [2023-11-30 04:37:04,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,278 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:37:04,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:37:04,524 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:37:04,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:37:04,594 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:37:04,594 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:37:04,599 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:37:04,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04 WrapperNode [2023-11-30 04:37:04,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:37:04,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:37:04,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:37:04,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:37:04,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,644 INFO L138 Inliner]: procedures = 173, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 91 [2023-11-30 04:37:04,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:37:04,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:37:04,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:37:04,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:37:04,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:37:04,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:37:04,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:37:04,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:37:04,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (1/1) ... [2023-11-30 04:37:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:37:04,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:37:04,687 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 04:37:04,713 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 04:37:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:37:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:37:04,734 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:37:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:37:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:37:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:37:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:37:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:37:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:37:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:37:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:37:04,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:37:04,736 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 04:37:04,841 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:37:04,843 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:37:04,992 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:37:05,042 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:37:05,042 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 04:37:05,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:37:05 BoogieIcfgContainer [2023-11-30 04:37:05,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:37:05,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:37:05,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:37:05,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:37:05,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:37:04" (1/3) ... [2023-11-30 04:37:05,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4942ff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:37:05, skipping insertion in model container [2023-11-30 04:37:05,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:37:04" (2/3) ... [2023-11-30 04:37:05,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4942ff05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:37:05, skipping insertion in model container [2023-11-30 04:37:05,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:37:05" (3/3) ... [2023-11-30 04:37:05,049 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2023-11-30 04:37:05,060 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:37:05,061 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-30 04:37:05,061 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:37:05,123 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:05,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 87 transitions, 178 flow [2023-11-30 04:37:05,194 INFO L124 PetriNetUnfolderBase]: 6/100 cut-off events. [2023-11-30 04:37:05,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:05,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 100 events. 6/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 173 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 72. Up to 4 conditions per place. [2023-11-30 04:37:05,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 87 transitions, 178 flow [2023-11-30 04:37:05,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 87 transitions, 178 flow [2023-11-30 04:37:05,211 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:05,215 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;@24bdc0fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:05,215 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-30 04:37:05,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:05,222 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:37:05,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:05,222 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:05,223 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:05,223 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 04:37:05,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1147694834, now seen corresponding path program 1 times [2023-11-30 04:37:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543154177] [2023-11-30 04:37:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:05,435 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 04:37:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543154177] [2023-11-30 04:37:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543154177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:05,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:05,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:05,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326513712] [2023-11-30 04:37:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:05,445 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:05,475 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 87 [2023-11-30 04:37:05,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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 04:37:05,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:05,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 87 [2023-11-30 04:37:05,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:05,664 INFO L124 PetriNetUnfolderBase]: 96/445 cut-off events. [2023-11-30 04:37:05,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:05,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 445 events. 96/445 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2419 event pairs, 49 based on Foata normal form. 51/349 useless extension candidates. Maximal degree in co-relation 637. Up to 120 conditions per place. [2023-11-30 04:37:05,670 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 46 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2023-11-30 04:37:05,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 294 flow [2023-11-30 04:37:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2023-11-30 04:37:05,685 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8160919540229885 [2023-11-30 04:37:05,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 213 transitions. [2023-11-30 04:37:05,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 213 transitions. [2023-11-30 04:37:05,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:05,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 213 transitions. [2023-11-30 04:37:05,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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 04:37:05,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 04:37:05,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 04:37:05,699 INFO L307 CegarLoopForPetriNet]: 85 programPoint places, -7 predicate places. [2023-11-30 04:37:05,699 INFO L500 AbstractCegarLoop]: Abstraction has has 78 places, 96 transitions, 294 flow [2023-11-30 04:37:05,699 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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 04:37:05,699 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:05,700 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:05,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:37:05,700 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 04:37:05,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1147694835, now seen corresponding path program 1 times [2023-11-30 04:37:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536215640] [2023-11-30 04:37:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:05,792 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 04:37:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536215640] [2023-11-30 04:37:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536215640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:05,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165810726] [2023-11-30 04:37:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:05,794 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:05,795 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 87 [2023-11-30 04:37:05,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 96 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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 04:37:05,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:05,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 87 [2023-11-30 04:37:05,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:05,868 INFO L124 PetriNetUnfolderBase]: 68/329 cut-off events. [2023-11-30 04:37:05,868 INFO L125 PetriNetUnfolderBase]: For 47/49 co-relation queries the response was YES. [2023-11-30 04:37:05,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 329 events. 68/329 cut-off events. For 47/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1466 event pairs, 39 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 611. Up to 155 conditions per place. [2023-11-30 04:37:05,870 INFO L140 encePairwiseOnDemand]: 85/87 looper letters, 40 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2023-11-30 04:37:05,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 368 flow [2023-11-30 04:37:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2023-11-30 04:37:05,871 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7088122605363985 [2023-11-30 04:37:05,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 185 transitions. [2023-11-30 04:37:05,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 185 transitions. [2023-11-30 04:37:05,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:05,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 185 transitions. [2023-11-30 04:37:05,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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 04:37:05,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 04:37:05,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 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 04:37:05,874 INFO L307 CegarLoopForPetriNet]: 85 programPoint places, -6 predicate places. [2023-11-30 04:37:05,874 INFO L500 AbstractCegarLoop]: Abstraction has has 79 places, 94 transitions, 368 flow [2023-11-30 04:37:05,874 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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 04:37:05,874 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:05,874 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:05,874 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:37:05,875 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-30 04:37:05,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1912865746, now seen corresponding path program 1 times [2023-11-30 04:37:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802625744] [2023-11-30 04:37:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:05,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:37:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:05,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:37:05,905 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:37:05,906 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-11-30 04:37:05,907 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-11-30 04:37:05,907 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-11-30 04:37:05,907 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-11-30 04:37:05,907 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (21 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-11-30 04:37:05,908 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (18 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-11-30 04:37:05,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (5 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (2 of 31 remaining) [2023-11-30 04:37:05,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-11-30 04:37:05,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-11-30 04:37:05,911 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:37:05,911 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:37:05,913 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:37:05,913 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:37:05,942 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:05,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 145 transitions, 300 flow [2023-11-30 04:37:05,957 INFO L124 PetriNetUnfolderBase]: 11/173 cut-off events. [2023-11-30 04:37:05,957 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:37:05,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 173 events. 11/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 509 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2023-11-30 04:37:05,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 145 transitions, 300 flow [2023-11-30 04:37:05,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 145 transitions, 300 flow [2023-11-30 04:37:05,961 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:05,962 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;@24bdc0fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:05,962 INFO L363 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-11-30 04:37:05,963 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:05,963 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:37:05,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:05,964 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:05,964 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:05,964 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:37:05,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2055134851, now seen corresponding path program 1 times [2023-11-30 04:37:05,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:05,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577594471] [2023-11-30 04:37:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:05,992 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 04:37:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:05,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577594471] [2023-11-30 04:37:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577594471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320560241] [2023-11-30 04:37:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:05,993 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:05,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:05,994 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 145 [2023-11-30 04:37:05,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 04:37:05,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:05,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 145 [2023-11-30 04:37:05,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:07,122 INFO L124 PetriNetUnfolderBase]: 4776/12212 cut-off events. [2023-11-30 04:37:07,122 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-11-30 04:37:07,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19803 conditions, 12212 events. 4776/12212 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 126509 event pairs, 2009 based on Foata normal form. 1501/9365 useless extension candidates. Maximal degree in co-relation 15266. Up to 4255 conditions per place. [2023-11-30 04:37:07,204 INFO L140 encePairwiseOnDemand]: 132/145 looper letters, 85 selfloop transitions, 4 changer transitions 0/169 dead transitions. [2023-11-30 04:37:07,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 169 transitions, 531 flow [2023-11-30 04:37:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-30 04:37:07,207 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8367816091954023 [2023-11-30 04:37:07,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-30 04:37:07,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-30 04:37:07,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:07,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-30 04:37:07,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 04:37:07,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:07,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:07,212 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, -10 predicate places. [2023-11-30 04:37:07,212 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 169 transitions, 531 flow [2023-11-30 04:37:07,213 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 04:37:07,213 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:07,213 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:07,213 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:37:07,213 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:37:07,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2055134852, now seen corresponding path program 1 times [2023-11-30 04:37:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:07,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829701616] [2023-11-30 04:37:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:07,339 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 04:37:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829701616] [2023-11-30 04:37:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829701616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976483803] [2023-11-30 04:37:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:07,340 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:07,341 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 145 [2023-11-30 04:37:07,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 169 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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 04:37:07,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:07,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 145 [2023-11-30 04:37:07,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:08,255 INFO L124 PetriNetUnfolderBase]: 4165/10232 cut-off events. [2023-11-30 04:37:08,255 INFO L125 PetriNetUnfolderBase]: For 1812/1984 co-relation queries the response was YES. [2023-11-30 04:37:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22278 conditions, 10232 events. 4165/10232 cut-off events. For 1812/1984 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 99838 event pairs, 1988 based on Foata normal form. 0/7702 useless extension candidates. Maximal degree in co-relation 17815. Up to 5787 conditions per place. [2023-11-30 04:37:08,310 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 75 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2023-11-30 04:37:08,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 167 transitions, 675 flow [2023-11-30 04:37:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-11-30 04:37:08,312 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7172413793103448 [2023-11-30 04:37:08,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-11-30 04:37:08,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-11-30 04:37:08,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:08,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-11-30 04:37:08,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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 04:37:08,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:08,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:08,319 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, -9 predicate places. [2023-11-30 04:37:08,319 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 167 transitions, 675 flow [2023-11-30 04:37:08,320 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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 04:37:08,320 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:08,320 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] [2023-11-30 04:37:08,323 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:37:08,323 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:37:08,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:08,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1354231663, now seen corresponding path program 1 times [2023-11-30 04:37:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066775917] [2023-11-30 04:37:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:08,402 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 04:37:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066775917] [2023-11-30 04:37:08,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066775917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:08,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:08,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:08,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406593208] [2023-11-30 04:37:08,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:08,404 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:08,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:08,408 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 145 [2023-11-30 04:37:08,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 167 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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 04:37:08,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:08,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 145 [2023-11-30 04:37:08,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:09,744 INFO L124 PetriNetUnfolderBase]: 6585/15481 cut-off events. [2023-11-30 04:37:09,744 INFO L125 PetriNetUnfolderBase]: For 7251/8103 co-relation queries the response was YES. [2023-11-30 04:37:09,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43566 conditions, 15481 events. 6585/15481 cut-off events. For 7251/8103 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 161496 event pairs, 1499 based on Foata normal form. 343/11962 useless extension candidates. Maximal degree in co-relation 40648. Up to 8734 conditions per place. [2023-11-30 04:37:09,844 INFO L140 encePairwiseOnDemand]: 131/145 looper letters, 146 selfloop transitions, 16 changer transitions 0/236 dead transitions. [2023-11-30 04:37:09,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 236 transitions, 1393 flow [2023-11-30 04:37:09,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-11-30 04:37:09,845 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2023-11-30 04:37:09,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-11-30 04:37:09,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-11-30 04:37:09,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:09,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-11-30 04:37:09,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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 04:37:09,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:09,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:09,849 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, -7 predicate places. [2023-11-30 04:37:09,849 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 236 transitions, 1393 flow [2023-11-30 04:37:09,849 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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 04:37:09,850 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:09,850 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] [2023-11-30 04:37:09,850 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:37:09,851 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:37:09,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1354231664, now seen corresponding path program 1 times [2023-11-30 04:37:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:09,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741477725] [2023-11-30 04:37:09,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:09,979 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 04:37:09,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:09,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741477725] [2023-11-30 04:37:09,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741477725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:09,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:09,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:09,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296032678] [2023-11-30 04:37:09,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:09,980 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:09,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:09,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:09,981 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 145 [2023-11-30 04:37:09,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 236 transitions, 1393 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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 04:37:09,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:09,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 145 [2023-11-30 04:37:09,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:10,991 INFO L124 PetriNetUnfolderBase]: 4822/12021 cut-off events. [2023-11-30 04:37:10,991 INFO L125 PetriNetUnfolderBase]: For 11116/11966 co-relation queries the response was YES. [2023-11-30 04:37:11,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38602 conditions, 12021 events. 4822/12021 cut-off events. For 11116/11966 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 120946 event pairs, 1215 based on Foata normal form. 627/10855 useless extension candidates. Maximal degree in co-relation 35030. Up to 5930 conditions per place. [2023-11-30 04:37:11,078 INFO L140 encePairwiseOnDemand]: 137/145 looper letters, 162 selfloop transitions, 3 changer transitions 0/255 dead transitions. [2023-11-30 04:37:11,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 255 transitions, 1885 flow [2023-11-30 04:37:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-11-30 04:37:11,080 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7540229885057471 [2023-11-30 04:37:11,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-11-30 04:37:11,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-11-30 04:37:11,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:11,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-11-30 04:37:11,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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 04:37:11,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:11,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 04:37:11,083 INFO L307 CegarLoopForPetriNet]: 141 programPoint places, -11 predicate places. [2023-11-30 04:37:11,083 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 255 transitions, 1885 flow [2023-11-30 04:37:11,083 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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 04:37:11,083 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:11,083 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:11,083 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:37:11,083 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-11-30 04:37:11,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -721506342, now seen corresponding path program 1 times [2023-11-30 04:37:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513049805] [2023-11-30 04:37:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:11,093 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:37:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:37:11,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:37:11,102 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-11-30 04:37:11,102 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (35 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (32 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-11-30 04:37:11,103 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-11-30 04:37:11,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (19 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (16 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-11-30 04:37:11,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (5 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (2 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2023-11-30 04:37:11,106 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2023-11-30 04:37:11,107 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:37:11,107 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 04:37:11,107 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:37:11,107 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:37:11,145 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:37:11,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 203 transitions, 424 flow [2023-11-30 04:37:11,167 INFO L124 PetriNetUnfolderBase]: 16/246 cut-off events. [2023-11-30 04:37:11,168 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:37:11,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 246 events. 16/246 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 899 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 186. Up to 8 conditions per place. [2023-11-30 04:37:11,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 203 transitions, 424 flow [2023-11-30 04:37:11,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 203 transitions, 424 flow [2023-11-30 04:37:11,172 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:37:11,172 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;@24bdc0fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:37:11,172 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-30 04:37:11,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:37:11,174 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:37:11,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:37:11,174 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:11,174 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:11,174 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:37:11,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash -110422962, now seen corresponding path program 1 times [2023-11-30 04:37:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780785199] [2023-11-30 04:37:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:11,200 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 04:37:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780785199] [2023-11-30 04:37:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780785199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:11,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:11,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377885836] [2023-11-30 04:37:11,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:11,201 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:11,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:11,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:11,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:11,202 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 203 [2023-11-30 04:37:11,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 203 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 04:37:11,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:11,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 203 [2023-11-30 04:37:11,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:34,638 INFO L124 PetriNetUnfolderBase]: 153204/304395 cut-off events. [2023-11-30 04:37:34,640 INFO L125 PetriNetUnfolderBase]: For 9825/9825 co-relation queries the response was YES. [2023-11-30 04:37:35,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515089 conditions, 304395 events. 153204/304395 cut-off events. For 9825/9825 co-relation queries the response was YES. Maximal size of possible extension queue 9902. Compared 3965731 event pairs, 60230 based on Foata normal form. 38452/231389 useless extension candidates. Maximal degree in co-relation 168982. Up to 122105 conditions per place. [2023-11-30 04:37:37,063 INFO L140 encePairwiseOnDemand]: 186/203 looper letters, 124 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2023-11-30 04:37:37,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 242 transitions, 772 flow [2023-11-30 04:37:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:37:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:37:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-11-30 04:37:37,065 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8456486042692939 [2023-11-30 04:37:37,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-11-30 04:37:37,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-11-30 04:37:37,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:37:37,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-11-30 04:37:37,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 04:37:37,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:37:37,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:37:37,068 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -13 predicate places. [2023-11-30 04:37:37,068 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 242 transitions, 772 flow [2023-11-30 04:37:37,068 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 04:37:37,069 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:37:37,069 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:37:37,069 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:37:37,069 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:37:37,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:37:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash -110422961, now seen corresponding path program 1 times [2023-11-30 04:37:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:37:37,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875053479] [2023-11-30 04:37:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:37:37,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:37:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:37:37,096 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 04:37:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:37:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875053479] [2023-11-30 04:37:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875053479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:37:37,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:37:37,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:37:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230685041] [2023-11-30 04:37:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:37:37,097 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:37:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:37:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:37:37,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:37:37,098 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 203 [2023-11-30 04:37:37,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 242 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 04:37:37,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:37:37,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 203 [2023-11-30 04:37:37,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:37:55,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([729] L710-1-->L710-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][145], [182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 39#L737-5true, 165#L710-2true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-30 04:37:55,089 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-11-30 04:37:55,089 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:37:55,089 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:37:55,089 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:37:57,467 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([729] L710-1-->L710-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3| 0) (= (store |v_#length_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 0)) (< |v_#StackHeapBarrier_1| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_3|} AuxVars[] AssignedVars[#valid, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread1of3ForFork0_push_~#newTop~0#1.base][145], [182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 147#L710-4true, 200#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 165#L710-2true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true]) [2023-11-30 04:37:57,467 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:37:57,468 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-30 04:37:57,468 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:37:57,468 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:38:00,826 INFO L124 PetriNetUnfolderBase]: 156161/296547 cut-off events. [2023-11-30 04:38:00,826 INFO L125 PetriNetUnfolderBase]: For 61018/66941 co-relation queries the response was YES. [2023-11-30 04:38:01,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679125 conditions, 296547 events. 156161/296547 cut-off events. For 61018/66941 co-relation queries the response was YES. Maximal size of possible extension queue 9441. Compared 3691286 event pairs, 70423 based on Foata normal form. 0/221138 useless extension candidates. Maximal degree in co-relation 248860. Up to 183034 conditions per place. [2023-11-30 04:38:03,664 INFO L140 encePairwiseOnDemand]: 201/203 looper letters, 110 selfloop transitions, 1 changer transitions 0/240 dead transitions. [2023-11-30 04:38:03,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 240 transitions, 986 flow [2023-11-30 04:38:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-30 04:38:03,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7208538587848933 [2023-11-30 04:38:03,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-30 04:38:03,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-30 04:38:03,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:03,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-30 04:38:03,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 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 04:38:03,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:38:03,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:38:03,672 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -12 predicate places. [2023-11-30 04:38:03,672 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 240 transitions, 986 flow [2023-11-30 04:38:03,672 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 04:38:03,672 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:03,672 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] [2023-11-30 04:38:03,673 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:38:03,673 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:38:03,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash -403840447, now seen corresponding path program 1 times [2023-11-30 04:38:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909693052] [2023-11-30 04:38:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:03,701 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 04:38:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909693052] [2023-11-30 04:38:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909693052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352263654] [2023-11-30 04:38:03,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:03,702 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:03,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:03,703 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 203 [2023-11-30 04:38:03,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 240 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 04:38:03,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:03,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 203 [2023-11-30 04:38:03,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:13,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L710-1-->L710-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][150], [208#true, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 200#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 71#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 173#L710-2true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:38:13,721 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-30 04:38:13,721 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:38:13,721 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:38:13,721 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:38:16,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L710-1-->L710-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][74], [27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 6#L710-3true, 210#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 173#L710-2true, 52#L737-4true, 202#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1)]) [2023-11-30 04:38:16,957 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-30 04:38:16,957 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-30 04:38:16,957 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 04:38:16,957 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-30 04:38:17,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L710-1-->L710-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][150], [208#true, thr1Thread1of3ForFork0InUse, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 200#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 173#L710-2true, 174#thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:38:17,032 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-30 04:38:17,032 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:38:17,032 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:38:17,032 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-30 04:38:17,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([672] L710-1-->L710-2: Formula: (and (not (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_#valid_1| (store |v_#valid_2| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_3| 1)) (= |v_#length_1| (store |v_#length_2| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_3| 4)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_3| 0) (< |v_#StackHeapBarrier_1| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_3|) (= (select |v_#valid_2| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_3|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread3of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread3of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_push_~#newTop~0#1.offset, #valid, thr1Thread3of3ForFork0_push_~#newTop~0#1.base, #length][132], [177#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 210#(= (select |#valid| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 1), 6#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 91#L710-2true, 52#L737-4true, 202#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1)]) [2023-11-30 04:38:17,061 INFO L294 olderBase$Statistics]: this new event has 85 ancestors and is cut-off event [2023-11-30 04:38:17,061 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-30 04:38:17,061 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-30 04:38:17,062 INFO L297 olderBase$Statistics]: existing Event has 85 ancestors and is cut-off event [2023-11-30 04:38:24,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([786] L710-1-->L710-2: Formula: (and (= (select |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) 0) (= (store |v_#valid_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 1) |v_#valid_1|) (< |v_#StackHeapBarrier_1| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|) (= (store |v_#length_2| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 4) |v_#length_1|) (not (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3| 0)) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{thr1Thread2of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset_3|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, thr1Thread2of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_3|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, thr1Thread2of3ForFork0_push_~#newTop~0#1.offset, #length, thr1Thread2of3ForFork0_push_~#newTop~0#1.base][150], [208#true, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 200#true, thr1Thread2of3ForFork0InUse, 44#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 173#L710-2true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:38:24,889 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-11-30 04:38:24,889 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:24,889 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:24,889 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:38:55,926 INFO L124 PetriNetUnfolderBase]: 283703/527023 cut-off events. [2023-11-30 04:38:55,926 INFO L125 PetriNetUnfolderBase]: For 247945/287708 co-relation queries the response was YES. [2023-11-30 04:38:57,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560017 conditions, 527023 events. 283703/527023 cut-off events. For 247945/287708 co-relation queries the response was YES. Maximal size of possible extension queue 17276. Compared 6923624 event pairs, 75686 based on Foata normal form. 7801/402427 useless extension candidates. Maximal degree in co-relation 1057283. Up to 320589 conditions per place. [2023-11-30 04:39:02,648 INFO L140 encePairwiseOnDemand]: 188/203 looper letters, 224 selfloop transitions, 18 changer transitions 0/349 dead transitions. [2023-11-30 04:39:02,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 349 transitions, 2102 flow [2023-11-30 04:39:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:39:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:39:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2023-11-30 04:39:02,650 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8045977011494253 [2023-11-30 04:39:02,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2023-11-30 04:39:02,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2023-11-30 04:39:02,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:39:02,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2023-11-30 04:39:02,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:02,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:39:02,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:39:02,656 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -10 predicate places. [2023-11-30 04:39:02,656 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 349 transitions, 2102 flow [2023-11-30 04:39:02,656 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 04:39:02,657 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:39:02,657 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] [2023-11-30 04:39:02,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:39:02,657 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:39:02,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:39:02,657 INFO L85 PathProgramCache]: Analyzing trace with hash -403840446, now seen corresponding path program 1 times [2023-11-30 04:39:02,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:39:02,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340043947] [2023-11-30 04:39:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:39:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:39:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:39:02,741 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 04:39:02,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:39:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340043947] [2023-11-30 04:39:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340043947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:39:02,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:39:02,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:39:02,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284937986] [2023-11-30 04:39:02,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:39:02,742 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:39:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:39:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:39:02,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:39:02,743 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 203 [2023-11-30 04:39:02,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 349 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 04:39:02,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:39:02,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 203 [2023-11-30 04:39:02,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:39:16,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L727-1-->L709: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_1|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_1|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_1|, thr1Thread1of3ForFork0_push_#t~mem3#1=|v_thr1Thread1of3ForFork0_push_#t~mem3#1_1|, thr1Thread1of3ForFork0_push_#t~mem6#1=|v_thr1Thread1of3ForFork0_push_#t~mem6#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_1|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, thr1Thread1of3ForFork0_push_#t~mem3#1, thr1Thread1of3ForFork0_push_#t~mem6#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem5#1][23], [208#true, thr1Thread1of3ForFork0InUse, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 39#L737-5true, 104#L709true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 212#true]) [2023-11-30 04:39:16,118 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-30 04:39:16,118 INFO L297 olderBase$Statistics]: existing Event has 65 ancestors and is cut-off event [2023-11-30 04:39:16,118 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-30 04:39:16,118 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-30 04:39:21,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L727-1-->L709: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_1|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_1|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_1|, thr1Thread1of3ForFork0_push_#t~mem3#1=|v_thr1Thread1of3ForFork0_push_#t~mem3#1_1|, thr1Thread1of3ForFork0_push_#t~mem6#1=|v_thr1Thread1of3ForFork0_push_#t~mem6#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_1|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, thr1Thread1of3ForFork0_push_#t~mem3#1, thr1Thread1of3ForFork0_push_#t~mem6#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem5#1][23], [208#true, thr1Thread1of3ForFork0InUse, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 104#L709true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true, 212#true]) [2023-11-30 04:39:21,939 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-30 04:39:21,940 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-30 04:39:21,940 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-11-30 04:39:21,940 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-30 04:39:51,717 INFO L124 PetriNetUnfolderBase]: 206977/397480 cut-off events. [2023-11-30 04:39:51,718 INFO L125 PetriNetUnfolderBase]: For 347850/379585 co-relation queries the response was YES. [2023-11-30 04:39:53,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373702 conditions, 397480 events. 206977/397480 cut-off events. For 347850/379585 co-relation queries the response was YES. Maximal size of possible extension queue 12835. Compared 5165199 event pairs, 37880 based on Foata normal form. 16423/345974 useless extension candidates. Maximal degree in co-relation 909014. Up to 220808 conditions per place. [2023-11-30 04:39:56,561 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 264 selfloop transitions, 3 changer transitions 0/403 dead transitions. [2023-11-30 04:39:56,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 403 transitions, 3080 flow [2023-11-30 04:39:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:39:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:39:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2023-11-30 04:39:56,562 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7783251231527094 [2023-11-30 04:39:56,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2023-11-30 04:39:56,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2023-11-30 04:39:56,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:39:56,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2023-11-30 04:39:56,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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 04:39:56,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:39:56,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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 04:39:56,565 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -14 predicate places. [2023-11-30 04:39:56,565 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 403 transitions, 3080 flow [2023-11-30 04:39:56,565 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 04:39:56,565 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:39:56,565 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] [2023-11-30 04:39:56,565 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:39:56,565 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err8ASSERT_VIOLATIONARRAY_INDEX === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:39:56,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:39:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1259140289, now seen corresponding path program 1 times [2023-11-30 04:39:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:39:56,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829066938] [2023-11-30 04:39:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:39:56,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:39:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:39:56,644 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 04:39:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:39:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829066938] [2023-11-30 04:39:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829066938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:39:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:39:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:39:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191189829] [2023-11-30 04:39:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:39:56,645 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:39:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:39:56,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:39:56,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:39:56,646 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 203 [2023-11-30 04:39:56,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 403 transitions, 3080 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 04:39:56,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:39:56,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 203 [2023-11-30 04:39:56,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:40:20,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 39#L737-5true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true]) [2023-11-30 04:40:20,641 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-30 04:40:20,641 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 04:40:20,641 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-11-30 04:40:20,641 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 04:40:25,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 39#L737-5true, 137#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true]) [2023-11-30 04:40:25,789 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-30 04:40:25,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-30 04:40:25,789 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-30 04:40:25,789 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-30 04:40:29,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true, 216#true]) [2023-11-30 04:40:29,767 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-30 04:40:29,767 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-30 04:40:29,767 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-30 04:40:29,767 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-30 04:40:35,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 137#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true, 216#true]) [2023-11-30 04:40:35,014 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-30 04:40:35,014 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:35,014 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:35,014 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-30 04:40:36,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, thr1Thread1of3ForFork0InUse, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 39#L737-5true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true]) [2023-11-30 04:40:36,189 INFO L294 olderBase$Statistics]: this new event has 95 ancestors and is cut-off event [2023-11-30 04:40:36,189 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:36,189 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-30 04:40:36,189 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:43,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 91#L710-2true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:43,812 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-30 04:40:43,812 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-30 04:40:43,812 INFO L297 olderBase$Statistics]: existing Event has 94 ancestors and is cut-off event [2023-11-30 04:40:43,812 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:45,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, thr1Thread1of3ForFork0InUse, 147#L710-4true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true, 216#true]) [2023-11-30 04:40:45,491 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-30 04:40:45,491 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:45,491 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-30 04:40:45,491 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-30 04:40:45,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, 20#L710-3true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:45,697 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-30 04:40:45,697 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:45,697 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-30 04:40:45,697 INFO L297 olderBase$Statistics]: existing Event has 95 ancestors and is cut-off event [2023-11-30 04:40:47,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, 24#thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:47,363 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,363 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,363 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,363 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, 42#thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:47,366 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,366 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,366 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,366 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 164#thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:47,370 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,370 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,371 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,371 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 86#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:47,371 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,371 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,371 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,371 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [75#L711-2true, 5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:47,372 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-30 04:40:47,372 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,372 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-11-30 04:40:47,372 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:48,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:48,841 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:40:48,841 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:40:48,841 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:40:48,841 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:40:48,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 100#L712true, 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:48,844 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:40:48,844 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:40:48,844 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:40:48,844 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:40:48,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 83#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:48,846 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2023-11-30 04:40:48,846 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:40:48,846 INFO L297 olderBase$Statistics]: existing Event has 97 ancestors and is cut-off event [2023-11-30 04:40:48,846 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2023-11-30 04:40:51,386 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][403], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, 72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 52#L737-4true]) [2023-11-30 04:40:51,386 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:40:51,386 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:40:51,387 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:40:51,387 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:40:51,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, 72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:51,426 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-11-30 04:40:51,426 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:40:51,426 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-11-30 04:40:51,426 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-11-30 04:40:52,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, 110#L715-1true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:52,943 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:40:52,943 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:52,943 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:52,943 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:52,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 137#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:52,943 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:40:52,943 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:52,943 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:52,944 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:52,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, 161#thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:52,944 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-11-30 04:40:52,944 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:52,944 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:52,944 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-30 04:40:55,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][403], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 137#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 52#L737-4true]) [2023-11-30 04:40:55,298 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-30 04:40:55,298 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:55,298 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 04:40:55,298 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:55,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 137#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:55,367 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-30 04:40:55,367 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 04:40:55,367 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:55,367 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-30 04:40:56,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 79#L716-1true, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:56,917 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 04:40:56,917 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:40:56,917 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-30 04:40:56,917 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2023-11-30 04:40:58,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, 114#L718-1true, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:58,495 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-30 04:40:58,495 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:40:58,495 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:58,495 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:58,496 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:58,496 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-30 04:40:58,496 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:58,496 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:40:58,496 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:58,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 126#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:58,497 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-11-30 04:40:58,497 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-11-30 04:40:58,497 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:58,497 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-11-30 04:40:59,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][403], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, 72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true, 216#true]) [2023-11-30 04:40:59,585 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-30 04:40:59,586 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-30 04:40:59,586 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 04:40:59,586 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 04:40:59,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:40:59,635 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2023-11-30 04:40:59,635 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 04:40:59,635 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2023-11-30 04:40:59,635 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-30 04:41:00,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 95#L721true, 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:41:00,364 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-30 04:41:00,364 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:41:00,364 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 04:41:00,364 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:41:00,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 152#thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:41:00,365 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-30 04:41:00,365 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:41:00,365 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:41:00,365 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 04:41:00,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 169#L710-3true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 36#thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:41:00,366 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-30 04:41:00,366 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 04:41:00,367 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:41:00,367 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 04:41:01,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][403], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, 33#thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 52#L737-4true, 216#true]) [2023-11-30 04:41:01,097 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 04:41:01,097 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-30 04:41:01,097 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-30 04:41:01,097 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 04:41:01,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 33#thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:41:01,112 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 04:41:01,112 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-30 04:41:01,112 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2023-11-30 04:41:01,112 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 04:41:02,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][344], [5#L710-4true, 214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 56#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 216#true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-30 04:41:02,443 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-30 04:41:02,443 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 04:41:02,443 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 04:41:02,443 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 04:41:02,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L722-->L710-4: Formula: (= (store |v_#valid_16| |v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29| 0) |v_#valid_15|) InVars {thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_16|} OutVars{thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_29|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#valid][403], [214#(and (= (select |#length| |thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 4) (= |thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| 0)), 5#L710-4true, 208#true, 182#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 200#true, thr1Thread3of3ForFork0InUse, 56#thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 52#L737-4true]) [2023-11-30 04:41:02,448 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-30 04:41:02,448 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 04:41:02,448 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-30 04:41:02,448 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 04:41:02,748 INFO L124 PetriNetUnfolderBase]: 298298/554755 cut-off events. [2023-11-30 04:41:02,749 INFO L125 PetriNetUnfolderBase]: For 795682/897243 co-relation queries the response was YES. [2023-11-30 04:41:05,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209019 conditions, 554755 events. 298298/554755 cut-off events. For 795682/897243 co-relation queries the response was YES. Maximal size of possible extension queue 17127. Compared 7181459 event pairs, 65894 based on Foata normal form. 382/452759 useless extension candidates. Maximal degree in co-relation 1688608. Up to 308330 conditions per place. [2023-11-30 04:41:11,336 INFO L140 encePairwiseOnDemand]: 190/203 looper letters, 402 selfloop transitions, 19 changer transitions 0/575 dead transitions. [2023-11-30 04:41:11,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 575 transitions, 5602 flow [2023-11-30 04:41:11,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:41:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:41:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions. [2023-11-30 04:41:11,340 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7463054187192119 [2023-11-30 04:41:11,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 909 transitions. [2023-11-30 04:41:11,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions. [2023-11-30 04:41:11,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:41:11,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions. [2023-11-30 04:41:11,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 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 04:41:11,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 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 04:41:11,343 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 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 04:41:11,344 INFO L307 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2023-11-30 04:41:11,344 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 575 transitions, 5602 flow [2023-11-30 04:41:11,344 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 04:41:11,344 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:41:11,344 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 04:41:11,345 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:41:11,345 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:41:11,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:41:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1206878721, now seen corresponding path program 1 times [2023-11-30 04:41:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:41:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91479879] [2023-11-30 04:41:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:41:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:41:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:41:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 04:41:11,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:41:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91479879] [2023-11-30 04:41:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91479879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:41:11,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:41:11,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:41:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507522252] [2023-11-30 04:41:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:41:11,393 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:41:11,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:41:11,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:41:11,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:41:11,395 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 203 [2023-11-30 04:41:11,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 575 transitions, 5602 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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 04:41:11,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:41:11,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 203 [2023-11-30 04:41:11,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:41:45,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L727-1-->L709: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_push_~d#1=|v_thr1Thread1of3ForFork0_push_~d#1_1|, thr1Thread1of3ForFork0_push_~oldTop~0#1=|v_thr1Thread1of3ForFork0_push_~oldTop~0#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset_1|, thr1Thread1of3ForFork0_push_#t~mem4#1=|v_thr1Thread1of3ForFork0_push_#t~mem4#1_1|, thr1Thread1of3ForFork0_push_#t~mem3#1=|v_thr1Thread1of3ForFork0_push_#t~mem3#1_1|, thr1Thread1of3ForFork0_push_#t~mem6#1=|v_thr1Thread1of3ForFork0_push_#t~mem6#1_1|, thr1Thread1of3ForFork0_push_~#newTop~0#1.base=|v_thr1Thread1of3ForFork0_push_~#newTop~0#1.base_1|, thr1Thread1of3ForFork0_push_#t~mem5#1=|v_thr1Thread1of3ForFork0_push_#t~mem5#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_push_~d#1, thr1Thread1of3ForFork0_push_~oldTop~0#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.offset, thr1Thread1of3ForFork0_push_#t~mem4#1, thr1Thread1of3ForFork0_push_#t~mem3#1, thr1Thread1of3ForFork0_push_#t~mem6#1, thr1Thread1of3ForFork0_push_~#newTop~0#1.base, thr1Thread1of3ForFork0_push_#t~mem5#1][68], [72#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 224#true, thr1Thread3of3ForFork0InUse, 104#L709true, 119#ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 208#true, 27#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 200#true, 206#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 216#true, 212#true]) [2023-11-30 04:41:45,390 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event [2023-11-30 04:41:45,390 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 04:41:45,390 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event [2023-11-30 04:41:45,390 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is not cut-off event