/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:04:45,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:04:45,793 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-12-05 21:04:45,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:04:45,826 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:04:45,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:04:45,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:04:45,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:04:45,828 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:04:45,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:04:45,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:04:45,832 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:04:45,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:04:45,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:04:45,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:04:45,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:04:45,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:04:45,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:04:45,834 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:04:45,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:04:45,835 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:04:45,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:04:45,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:04:45,836 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:04:45,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:04:45,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:45,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:04:45,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:04:45,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:04:45,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:04:45,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:04:45,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:04:45,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:04:45,838 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-12-05 21:04:46,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:04:46,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:04:46,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:04:46,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:04:46,119 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:04:46,120 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-pthread.i [2023-12-05 21:04:47,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:04:47,531 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:04:47,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur-pthread.i [2023-12-05 21:04:47,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a61a0df3/836e4ce6ab124f59a71874125d7b5018/FLAG77ed8a976 [2023-12-05 21:04:47,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a61a0df3/836e4ce6ab124f59a71874125d7b5018 [2023-12-05 21:04:47,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:04:47,562 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:04:47,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:47,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:04:47,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:04:47,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:47" (1/1) ... [2023-12-05 21:04:47,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a255afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:47, skipping insertion in model container [2023-12-05 21:04:47,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:47" (1/1) ... [2023-12-05 21:04:47,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:04:47,912 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:47,924 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:04:47,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:48,023 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:04:48,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48 WrapperNode [2023-12-05 21:04:48,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:48,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:48,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:04:48,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:04:48,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,062 INFO L138 Inliner]: procedures = 165, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 85 [2023-12-05 21:04:48,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:48,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:04:48,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:04:48,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:04:48,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:04:48,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:04:48,089 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:04:48,089 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:04:48,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (1/1) ... [2023-12-05 21:04:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:04:48,115 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-12-05 21:04:48,117 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-12-05 21:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:04:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:04:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:04:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:04:48,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:04:48,141 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:04:48,252 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:04:48,255 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:04:48,479 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:04:48,556 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:04:48,557 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 21:04:48,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:48 BoogieIcfgContainer [2023-12-05 21:04:48,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:04:48,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:04:48,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:04:48,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:04:48,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:04:47" (1/3) ... [2023-12-05 21:04:48,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ada4ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:48, skipping insertion in model container [2023-12-05 21:04:48,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:48" (2/3) ... [2023-12-05 21:04:48,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ada4ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:48, skipping insertion in model container [2023-12-05 21:04:48,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:48" (3/3) ... [2023-12-05 21:04:48,572 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur-pthread.i [2023-12-05 21:04:48,587 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:04:48,588 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 21:04:48,588 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:04:48,654 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:48,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 105 transitions, 214 flow [2023-12-05 21:04:48,743 INFO L124 PetriNetUnfolderBase]: 8/118 cut-off events. [2023-12-05 21:04:48,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:48,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 118 events. 8/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 197 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2023-12-05 21:04:48,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 105 transitions, 214 flow [2023-12-05 21:04:48,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 105 transitions, 214 flow [2023-12-05 21:04:48,764 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:48,770 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;@1777bc44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:48,771 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-12-05 21:04:48,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:48,778 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-12-05 21:04:48,778 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:48,779 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:48,779 INFO L233 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] [2023-12-05 21:04:48,780 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:04:48,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2117625798, now seen corresponding path program 1 times [2023-12-05 21:04:48,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:48,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777469254] [2023-12-05 21:04:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:49,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777469254] [2023-12-05 21:04:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777469254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:49,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:49,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955658382] [2023-12-05 21:04:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:49,104 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:49,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:49,147 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 105 [2023-12-05 21:04:49,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 105 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:49,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 105 [2023-12-05 21:04:49,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:49,400 INFO L124 PetriNetUnfolderBase]: 93/482 cut-off events. [2023-12-05 21:04:49,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:49,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 482 events. 93/482 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2620 event pairs, 48 based on Foata normal form. 59/399 useless extension candidates. Maximal degree in co-relation 654. Up to 111 conditions per place. [2023-12-05 21:04:49,407 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 43 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2023-12-05 21:04:49,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 310 flow [2023-12-05 21:04:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-12-05 21:04:49,420 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2023-12-05 21:04:49,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-12-05 21:04:49,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-12-05 21:04:49,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:49,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-12-05 21:04:49,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,434 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, -10 predicate places. [2023-12-05 21:04:49,434 INFO L500 AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 310 flow [2023-12-05 21:04:49,434 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,434 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:49,435 INFO L233 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] [2023-12-05 21:04:49,435 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:04:49,435 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:04:49,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2117625797, now seen corresponding path program 1 times [2023-12-05 21:04:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390429700] [2023-12-05 21:04:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390429700] [2023-12-05 21:04:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390429700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:49,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:49,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:49,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099699805] [2023-12-05 21:04:49,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:49,562 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:49,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:49,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:49,564 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 105 [2023-12-05 21:04:49,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 310 flow. Second operand has 3 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-12-05 21:04:49,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:49,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 105 [2023-12-05 21:04:49,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:49,660 INFO L124 PetriNetUnfolderBase]: 69/359 cut-off events. [2023-12-05 21:04:49,661 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2023-12-05 21:04:49,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 359 events. 69/359 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1599 event pairs, 40 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 620. Up to 147 conditions per place. [2023-12-05 21:04:49,667 INFO L140 encePairwiseOnDemand]: 103/105 looper letters, 36 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2023-12-05 21:04:49,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 105 transitions, 376 flow [2023-12-05 21:04:49,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-12-05 21:04:49,673 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7365079365079366 [2023-12-05 21:04:49,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-12-05 21:04:49,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-12-05 21:04:49,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:49,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-12-05 21:04:49,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,679 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, -9 predicate places. [2023-12-05 21:04:49,679 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 105 transitions, 376 flow [2023-12-05 21:04:49,679 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12-05 21:04:49,679 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:49,680 INFO L233 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] [2023-12-05 21:04:49,680 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:04:49,680 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:04:49,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2072875580, now seen corresponding path program 1 times [2023-12-05 21:04:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164653473] [2023-12-05 21:04:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:49,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:49,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:49,752 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:49,753 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-12-05 21:04:49,755 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-12-05 21:04:49,755 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-12-05 21:04:49,756 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-12-05 21:04:49,756 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-12-05 21:04:49,756 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-12-05 21:04:49,756 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-12-05 21:04:49,756 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-12-05 21:04:49,757 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-12-05 21:04:49,757 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (21 of 31 remaining) [2023-12-05 21:04:49,757 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-12-05 21:04:49,757 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-12-05 21:04:49,757 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (18 of 31 remaining) [2023-12-05 21:04:49,758 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-12-05 21:04:49,758 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-12-05 21:04:49,758 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-12-05 21:04:49,758 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-12-05 21:04:49,758 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-12-05 21:04:49,758 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-12-05 21:04:49,759 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-12-05 21:04:49,759 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-12-05 21:04:49,759 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-12-05 21:04:49,759 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-12-05 21:04:49,759 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-12-05 21:04:49,760 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-12-05 21:04:49,760 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (5 of 31 remaining) [2023-12-05 21:04:49,760 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-12-05 21:04:49,760 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-12-05 21:04:49,760 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (2 of 31 remaining) [2023-12-05 21:04:49,761 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-12-05 21:04:49,761 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-12-05 21:04:49,761 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:04:49,762 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:49,770 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:49,771 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:04:49,833 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:49,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 175 transitions, 360 flow [2023-12-05 21:04:49,877 INFO L124 PetriNetUnfolderBase]: 15/203 cut-off events. [2023-12-05 21:04:49,877 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:49,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 203 events. 15/203 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 594 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 153. Up to 6 conditions per place. [2023-12-05 21:04:49,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 175 transitions, 360 flow [2023-12-05 21:04:49,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 175 transitions, 360 flow [2023-12-05 21:04:49,885 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:49,886 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;@1777bc44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:49,886 INFO L363 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2023-12-05 21:04:49,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:49,888 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-12-05 21:04:49,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:49,889 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:49,889 INFO L233 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] [2023-12-05 21:04:49,889 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-05 21:04:49,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash 354813001, now seen corresponding path program 1 times [2023-12-05 21:04:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742940139] [2023-12-05 21:04:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:49,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742940139] [2023-12-05 21:04:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742940139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813149050] [2023-12-05 21:04:49,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:49,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:49,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:49,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:49,948 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 175 [2023-12-05 21:04:49,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 175 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:49,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:49,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 175 [2023-12-05 21:04:49,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:51,563 INFO L124 PetriNetUnfolderBase]: 4084/12073 cut-off events. [2023-12-05 21:04:51,564 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2023-12-05 21:04:51,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18470 conditions, 12073 events. 4084/12073 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 131441 event pairs, 1762 based on Foata normal form. 1774/9955 useless extension candidates. Maximal degree in co-relation 14223. Up to 3464 conditions per place. [2023-12-05 21:04:51,672 INFO L140 encePairwiseOnDemand]: 158/175 looper letters, 78 selfloop transitions, 4 changer transitions 0/185 dead transitions. [2023-12-05 21:04:51,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 185 transitions, 549 flow [2023-12-05 21:04:51,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-12-05 21:04:51,675 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8495238095238096 [2023-12-05 21:04:51,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-12-05 21:04:51,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-12-05 21:04:51,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:51,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-12-05 21:04:51,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:51,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:51,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:51,681 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -16 predicate places. [2023-12-05 21:04:51,681 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 185 transitions, 549 flow [2023-12-05 21:04:51,682 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:51,682 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:51,682 INFO L233 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] [2023-12-05 21:04:51,682 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:04:51,682 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-05 21:04:51,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 354813002, now seen corresponding path program 1 times [2023-12-05 21:04:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992376239] [2023-12-05 21:04:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992376239] [2023-12-05 21:04:51,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992376239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:51,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:51,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:51,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603863172] [2023-12-05 21:04:51,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:51,792 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:51,794 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 175 [2023-12-05 21:04:51,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 185 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:51,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:51,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 175 [2023-12-05 21:04:51,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:53,061 INFO L124 PetriNetUnfolderBase]: 3874/10649 cut-off events. [2023-12-05 21:04:53,061 INFO L125 PetriNetUnfolderBase]: For 2109/2490 co-relation queries the response was YES. [2023-12-05 21:04:53,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21459 conditions, 10649 events. 3874/10649 cut-off events. For 2109/2490 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 109186 event pairs, 1928 based on Foata normal form. 0/8485 useless extension candidates. Maximal degree in co-relation 17240. Up to 5225 conditions per place. [2023-12-05 21:04:53,140 INFO L140 encePairwiseOnDemand]: 173/175 looper letters, 66 selfloop transitions, 1 changer transitions 0/183 dead transitions. [2023-12-05 21:04:53,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 183 transitions, 675 flow [2023-12-05 21:04:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2023-12-05 21:04:53,145 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2023-12-05 21:04:53,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2023-12-05 21:04:53,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2023-12-05 21:04:53,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:53,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2023-12-05 21:04:53,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,154 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -15 predicate places. [2023-12-05 21:04:53,154 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 183 transitions, 675 flow [2023-12-05 21:04:53,154 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,154 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:53,155 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:53,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:04:53,156 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-05 21:04:53,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2047825239, now seen corresponding path program 1 times [2023-12-05 21:04:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786374183] [2023-12-05 21:04:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786374183] [2023-12-05 21:04:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786374183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:53,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:53,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:53,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069388879] [2023-12-05 21:04:53,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:53,209 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:53,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:53,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:53,210 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 175 [2023-12-05 21:04:53,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 183 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:53,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 175 [2023-12-05 21:04:53,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:54,448 INFO L124 PetriNetUnfolderBase]: 3908/10463 cut-off events. [2023-12-05 21:04:54,449 INFO L125 PetriNetUnfolderBase]: For 3203/3781 co-relation queries the response was YES. [2023-12-05 21:04:54,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23083 conditions, 10463 events. 3908/10463 cut-off events. For 3203/3781 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 106684 event pairs, 1726 based on Foata normal form. 0/8262 useless extension candidates. Maximal degree in co-relation 19902. Up to 5295 conditions per place. [2023-12-05 21:04:54,531 INFO L140 encePairwiseOnDemand]: 168/175 looper letters, 36 selfloop transitions, 3 changer transitions 0/190 dead transitions. [2023-12-05 21:04:54,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 190 transitions, 800 flow [2023-12-05 21:04:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-12-05 21:04:54,533 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2023-12-05 21:04:54,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-12-05 21:04:54,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-12-05 21:04:54,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:54,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-12-05 21:04:54,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,538 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -13 predicate places. [2023-12-05 21:04:54,538 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 190 transitions, 800 flow [2023-12-05 21:04:54,538 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,538 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:54,539 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:54,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:04:54,539 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-05 21:04:54,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2047825237, now seen corresponding path program 1 times [2023-12-05 21:04:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586069992] [2023-12-05 21:04:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586069992] [2023-12-05 21:04:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586069992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:54,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:54,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863659081] [2023-12-05 21:04:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:54,606 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:54,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:54,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:54,607 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 175 [2023-12-05 21:04:54,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 190 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:54,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 175 [2023-12-05 21:04:54,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:56,312 INFO L124 PetriNetUnfolderBase]: 6278/16060 cut-off events. [2023-12-05 21:04:56,312 INFO L125 PetriNetUnfolderBase]: For 11054/13887 co-relation queries the response was YES. [2023-12-05 21:04:56,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44545 conditions, 16060 events. 6278/16060 cut-off events. For 11054/13887 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 174426 event pairs, 1537 based on Foata normal form. 400/13068 useless extension candidates. Maximal degree in co-relation 41268. Up to 8161 conditions per place. [2023-12-05 21:04:56,473 INFO L140 encePairwiseOnDemand]: 161/175 looper letters, 145 selfloop transitions, 16 changer transitions 0/257 dead transitions. [2023-12-05 21:04:56,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 257 transitions, 1561 flow [2023-12-05 21:04:56,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-12-05 21:04:56,476 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7980952380952381 [2023-12-05 21:04:56,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-12-05 21:04:56,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-12-05 21:04:56,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:56,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-12-05 21:04:56,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,480 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -11 predicate places. [2023-12-05 21:04:56,480 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 257 transitions, 1561 flow [2023-12-05 21:04:56,480 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,480 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:56,481 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:56,481 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:04:56,481 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-05 21:04:56,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:56,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2047825236, now seen corresponding path program 1 times [2023-12-05 21:04:56,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151341877] [2023-12-05 21:04:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:56,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151341877] [2023-12-05 21:04:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151341877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:56,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:56,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631594768] [2023-12-05 21:04:56,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:56,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:56,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:56,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:56,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:56,613 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 175 [2023-12-05 21:04:56,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 257 transitions, 1561 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:56,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:56,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 175 [2023-12-05 21:04:56,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:58,150 INFO L124 PetriNetUnfolderBase]: 4561/12177 cut-off events. [2023-12-05 21:04:58,150 INFO L125 PetriNetUnfolderBase]: For 15293/18938 co-relation queries the response was YES. [2023-12-05 21:04:58,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38410 conditions, 12177 events. 4561/12177 cut-off events. For 15293/18938 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 126859 event pairs, 1196 based on Foata normal form. 793/11382 useless extension candidates. Maximal degree in co-relation 34606. Up to 5462 conditions per place. [2023-12-05 21:04:58,245 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 154 selfloop transitions, 3 changer transitions 0/272 dead transitions. [2023-12-05 21:04:58,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 272 transitions, 2019 flow [2023-12-05 21:04:58,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-12-05 21:04:58,248 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2023-12-05 21:04:58,249 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-12-05 21:04:58,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-12-05 21:04:58,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:58,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-12-05 21:04:58,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:58,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:58,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:58,253 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -15 predicate places. [2023-12-05 21:04:58,254 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 272 transitions, 2019 flow [2023-12-05 21:04:58,254 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:58,254 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:58,254 INFO L233 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, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:58,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:04:58,254 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2023-12-05 21:04:58,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -136055252, now seen corresponding path program 1 times [2023-12-05 21:04:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073836522] [2023-12-05 21:04:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:58,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:58,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:58,299 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:58,300 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2023-12-05 21:04:58,300 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2023-12-05 21:04:58,300 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2023-12-05 21:04:58,301 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2023-12-05 21:04:58,301 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2023-12-05 21:04:58,303 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (35 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (32 of 45 remaining) [2023-12-05 21:04:58,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2023-12-05 21:04:58,305 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (19 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (16 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2023-12-05 21:04:58,306 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2023-12-05 21:04:58,307 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2023-12-05 21:04:58,307 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2023-12-05 21:04:58,307 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2023-12-05 21:04:58,307 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2023-12-05 21:04:58,308 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONARRAY_INDEX (5 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONARRAY_INDEX (2 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 45 remaining) [2023-12-05 21:04:58,309 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 45 remaining) [2023-12-05 21:04:58,310 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:04:58,310 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:04:58,311 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:58,311 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:04:58,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:58,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 245 transitions, 508 flow [2023-12-05 21:04:58,420 INFO L124 PetriNetUnfolderBase]: 22/288 cut-off events. [2023-12-05 21:04:58,420 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:58,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 288 events. 22/288 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1058 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 222. Up to 8 conditions per place. [2023-12-05 21:04:58,423 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 245 transitions, 508 flow [2023-12-05 21:04:58,428 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 245 transitions, 508 flow [2023-12-05 21:04:58,429 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:58,431 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;@1777bc44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:58,431 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-12-05 21:04:58,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:58,433 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2023-12-05 21:04:58,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:58,433 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:58,433 INFO L233 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] [2023-12-05 21:04:58,433 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:04:58,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1239246942, now seen corresponding path program 1 times [2023-12-05 21:04:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876264851] [2023-12-05 21:04:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:58,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:58,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876264851] [2023-12-05 21:04:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876264851] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:58,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:58,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:58,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2277782] [2023-12-05 21:04:58,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:58,497 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:58,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:58,498 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 245 [2023-12-05 21:04:58,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 245 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:58,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:58,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 245 [2023-12-05 21:04:58,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:27,548 INFO L124 PetriNetUnfolderBase]: 116156/269525 cut-off events. [2023-12-05 21:05:27,548 INFO L125 PetriNetUnfolderBase]: For 7619/7619 co-relation queries the response was YES. [2023-12-05 21:05:28,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428183 conditions, 269525 events. 116156/269525 cut-off events. For 7619/7619 co-relation queries the response was YES. Maximal size of possible extension queue 8106. Compared 3864083 event pairs, 47645 based on Foata normal form. 43663/222983 useless extension candidates. Maximal degree in co-relation 137636. Up to 88265 conditions per place. [2023-12-05 21:05:30,681 INFO L140 encePairwiseOnDemand]: 222/245 looper letters, 113 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2023-12-05 21:05:30,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 263 transitions, 792 flow [2023-12-05 21:05:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-12-05 21:05:30,683 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2023-12-05 21:05:30,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-12-05 21:05:30,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-12-05 21:05:30,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:30,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-12-05 21:05:30,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:30,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:30,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:30,688 INFO L308 CegarLoopForPetriNet]: 233 programPoint places, -22 predicate places. [2023-12-05 21:05:30,688 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 263 transitions, 792 flow [2023-12-05 21:05:30,688 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:30,688 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:30,689 INFO L233 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] [2023-12-05 21:05:30,689 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:05:30,689 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:05:30,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1239246943, now seen corresponding path program 1 times [2023-12-05 21:05:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:30,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112435763] [2023-12-05 21:05:30,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112435763] [2023-12-05 21:05:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112435763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:30,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:30,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:30,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884014361] [2023-12-05 21:05:30,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:30,734 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:30,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:30,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:30,735 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 245 [2023-12-05 21:05:30,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 263 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:30,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:30,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 245 [2023-12-05 21:05:30,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:41,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][152], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:05:41,755 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-12-05 21:05:41,755 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:05:41,755 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-12-05 21:05:41,755 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:05:44,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][152], [236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:05:44,118 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-12-05 21:05:44,119 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:05:44,119 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:05:44,119 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-05 21:05:45,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][152], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:05:45,981 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-05 21:05:45,981 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:05:45,981 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-05 21:05:45,981 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:05:46,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][151], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:05:46,511 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-12-05 21:05:46,512 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-12-05 21:05:46,512 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:05:46,512 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:05:48,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][152], [236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:05:48,867 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-05 21:05:48,867 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:05:48,868 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:05:48,868 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-12-05 21:05:49,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][151], [thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:05:49,087 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-12-05 21:05:49,087 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:05:49,087 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-05 21:05:49,087 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:05:50,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][152], [thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-12-05 21:05:50,014 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-12-05 21:05:50,014 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-05 21:05:50,014 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-12-05 21:05:50,014 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-05 21:05:50,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][151], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:05:50,955 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-05 21:05:50,955 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-05 21:05:50,955 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:05:50,955 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:05:53,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][151], [thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:05:53,601 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-05 21:05:53,601 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-12-05 21:05:53,602 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:05:53,602 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:05:54,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][152], [236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 97#L699-4true]) [2023-12-05 21:05:54,456 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-12-05 21:05:54,456 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-12-05 21:05:54,456 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-12-05 21:05:54,456 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-12-05 21:06:09,261 INFO L124 PetriNetUnfolderBase]: 136003/288556 cut-off events. [2023-12-05 21:06:09,261 INFO L125 PetriNetUnfolderBase]: For 67916/80443 co-relation queries the response was YES. [2023-12-05 21:06:11,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613526 conditions, 288556 events. 136003/288556 cut-off events. For 67916/80443 co-relation queries the response was YES. Maximal size of possible extension queue 8641. Compared 3915442 event pairs, 65154 based on Foata normal form. 0/228135 useless extension candidates. Maximal degree in co-relation 227054. Up to 157420 conditions per place. [2023-12-05 21:06:14,131 INFO L140 encePairwiseOnDemand]: 243/245 looper letters, 96 selfloop transitions, 1 changer transitions 0/261 dead transitions. [2023-12-05 21:06:14,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 261 transitions, 978 flow [2023-12-05 21:06:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2023-12-05 21:06:14,141 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.745578231292517 [2023-12-05 21:06:14,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2023-12-05 21:06:14,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2023-12-05 21:06:14,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:14,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2023-12-05 21:06:14,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:14,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:14,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:14,162 INFO L308 CegarLoopForPetriNet]: 233 programPoint places, -21 predicate places. [2023-12-05 21:06:14,162 INFO L500 AbstractCegarLoop]: Abstraction has has 212 places, 261 transitions, 978 flow [2023-12-05 21:06:14,162 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:14,162 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:14,163 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:14,163 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:06:14,163 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:06:14,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1357528825, now seen corresponding path program 1 times [2023-12-05 21:06:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768777257] [2023-12-05 21:06:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:14,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768777257] [2023-12-05 21:06:14,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768777257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:14,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:14,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500456689] [2023-12-05 21:06:14,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:14,230 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:14,232 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 245 [2023-12-05 21:06:14,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 261 transitions, 978 flow. Second operand has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:14,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:14,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 245 [2023-12-05 21:06:14,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:29,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][158], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:06:29,716 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-12-05 21:06:29,716 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:06:29,716 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:06:29,716 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-12-05 21:06:33,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][158], [236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:06:33,462 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-12-05 21:06:33,463 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:06:33,463 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:06:33,463 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-05 21:06:35,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][158], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 236#true, thr1Thread1of3ForFork0InUse, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:06:35,906 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-05 21:06:35,906 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-05 21:06:35,906 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:06:35,906 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:06:36,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][157], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 236#true, thr1Thread1of3ForFork0InUse, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:06:36,388 INFO L294 olderBase$Statistics]: this new event has 96 ancestors and is cut-off event [2023-12-05 21:06:36,388 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2023-12-05 21:06:36,388 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:06:36,388 INFO L297 olderBase$Statistics]: existing Event has 96 ancestors and is cut-off event [2023-12-05 21:06:38,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][158], [236#true, thr1Thread1of3ForFork0InUse, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true]) [2023-12-05 21:06:38,769 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-05 21:06:38,769 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:06:38,769 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-12-05 21:06:38,769 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:06:38,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][157], [thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, 168#L699-2true, thr1Thread3of3ForFork0InUse, 19#L699-4true]) [2023-12-05 21:06:38,979 INFO L294 olderBase$Statistics]: this new event has 99 ancestors and is cut-off event [2023-12-05 21:06:38,979 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-05 21:06:38,979 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:06:38,979 INFO L297 olderBase$Statistics]: existing Event has 99 ancestors and is cut-off event [2023-12-05 21:06:39,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][158], [thr1Thread1of3ForFork0InUse, 236#true, 122#L719-5true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 97#L699-4true]) [2023-12-05 21:06:39,909 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is cut-off event [2023-12-05 21:06:39,909 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-05 21:06:39,909 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2023-12-05 21:06:39,909 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2023-12-05 21:06:40,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][157], [124#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:06:40,853 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-12-05 21:06:40,853 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:06:40,853 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-12-05 21:06:40,853 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-05 21:06:44,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([852] L699-1-->L699-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][157], [thr1Thread1of3ForFork0InUse, 236#true, 73#thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 78#L719-4true, thr1Thread2of3ForFork0InUse, 244#true, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), thr1Thread3of3ForFork0InUse, 168#L699-2true, 19#L699-4true]) [2023-12-05 21:06:44,016 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2023-12-05 21:06:44,016 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:06:44,016 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-12-05 21:06:44,016 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2023-12-05 21:06:45,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L699-1-->L699-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][158], [thr1Thread1of3ForFork0InUse, 236#true, 78#L719-4true, thr1Thread2of3ForFork0InUse, 242#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 244#true, thr1Thread3of3ForFork0InUse, 50#L699-2true, 97#L699-4true, 105#thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-12-05 21:06:45,235 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2023-12-05 21:06:45,236 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-12-05 21:06:45,236 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-12-05 21:06:45,236 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2023-12-05 21:07:02,133 INFO L124 PetriNetUnfolderBase]: 136284/282546 cut-off events. [2023-12-05 21:07:02,134 INFO L125 PetriNetUnfolderBase]: For 98334/116780 co-relation queries the response was YES. [2023-12-05 21:07:03,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662061 conditions, 282546 events. 136284/282546 cut-off events. For 98334/116780 co-relation queries the response was YES. Maximal size of possible extension queue 8670. Compared 3792129 event pairs, 57172 based on Foata normal form. 0/221966 useless extension candidates. Maximal degree in co-relation 501849. Up to 157682 conditions per place. [2023-12-05 21:07:06,859 INFO L140 encePairwiseOnDemand]: 235/245 looper letters, 55 selfloop transitions, 4 changer transitions 0/272 dead transitions. [2023-12-05 21:07:06,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 272 transitions, 1174 flow [2023-12-05 21:07:06,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2023-12-05 21:07:06,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8734693877551021 [2023-12-05 21:07:06,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2023-12-05 21:07:06,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2023-12-05 21:07:06,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:06,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2023-12-05 21:07:06,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:06,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:06,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:06,882 INFO L308 CegarLoopForPetriNet]: 233 programPoint places, -19 predicate places. [2023-12-05 21:07:06,882 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 272 transitions, 1174 flow [2023-12-05 21:07:06,882 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.0) internal successors, (603), 3 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:06,882 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:06,882 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:06,883 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:07:06,883 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-05 21:07:06,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:06,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1357528827, now seen corresponding path program 1 times [2023-12-05 21:07:06,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:06,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245773480] [2023-12-05 21:07:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:06,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:06,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245773480] [2023-12-05 21:07:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245773480] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:06,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60923176] [2023-12-05 21:07:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:06,977 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:06,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:06,979 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 245 [2023-12-05 21:07:06,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 272 transitions, 1174 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:06,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:06,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 245 [2023-12-05 21:07:06,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand