/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/28_buggy_simple_loop1_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:04:04,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:04:04,920 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:04,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:04:04,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:04:04,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:04:04,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:04:04,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:04:04,946 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:04:04,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:04:04,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:04:04,949 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:04:04,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:04:04,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:04:04,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:04:04,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:04:04,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:04:04,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:04:04,951 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:04:04,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:04:04,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:04:04,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:04:04,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:04:04,952 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:04:04,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:04:04,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:04,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:04:04,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:04:04,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:04:04,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:04:04,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:04:04,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:04:04,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:04:04,954 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:05,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:04:05,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:04:05,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:04:05,142 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:04:05,143 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:04:05,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i [2023-12-05 21:04:06,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:04:06,487 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:04:06,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i [2023-12-05 21:04:06,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f79f031/e06207c2ee164c0cbdc269a533a00f6c/FLAGa7966ffd5 [2023-12-05 21:04:06,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f79f031/e06207c2ee164c0cbdc269a533a00f6c [2023-12-05 21:04:06,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:04:06,512 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:04:06,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:06,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:04:06,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:04:06,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:06" (1/1) ... [2023-12-05 21:04:06,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1623945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:06, skipping insertion in model container [2023-12-05 21:04:06,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:06" (1/1) ... [2023-12-05 21:04:06,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:04:06,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:06,746 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:04:06,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:06,795 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:04:06,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:06 WrapperNode [2023-12-05 21:04:06,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:06,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:06,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:04:06,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:04:06,801 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:06" (1/1) ... [2023-12-05 21:04:06,809 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:06" (1/1) ... [2023-12-05 21:04:06,821 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-12-05 21:04:06,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:06,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:04:06,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:04:06,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:04:06,828 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:06" (1/1) ... [2023-12-05 21:04:06,828 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:06" (1/1) ... [2023-12-05 21:04:06,830 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:06" (1/1) ... [2023-12-05 21:04:06,830 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:06" (1/1) ... [2023-12-05 21:04:06,833 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:06" (1/1) ... [2023-12-05 21:04:06,835 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:06" (1/1) ... [2023-12-05 21:04:06,836 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:06" (1/1) ... [2023-12-05 21:04:06,837 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:06" (1/1) ... [2023-12-05 21:04:06,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:04:06,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:04:06,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:04:06,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:04:06,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:06" (1/1) ... [2023-12-05 21:04:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:06,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:04:06,867 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:06,869 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:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:04:06,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:04:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:04:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:04:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:04:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:04:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:04:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:04:06,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:04:06,898 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:07,075 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:04:07,077 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:04:07,215 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:04:07,228 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:04:07,228 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-05 21:04:07,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:07 BoogieIcfgContainer [2023-12-05 21:04:07,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:04:07,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:04:07,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:04:07,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:04:07,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:04:06" (1/3) ... [2023-12-05 21:04:07,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aec9c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:07, skipping insertion in model container [2023-12-05 21:04:07,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:06" (2/3) ... [2023-12-05 21:04:07,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aec9c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:07, skipping insertion in model container [2023-12-05 21:04:07,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:07" (3/3) ... [2023-12-05 21:04:07,236 INFO L112 eAbstractionObserver]: Analyzing ICFG 28_buggy_simple_loop1_vf.i [2023-12-05 21:04:07,250 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:04:07,250 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:04:07,250 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:04:07,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:07,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 73 transitions, 150 flow [2023-12-05 21:04:07,416 INFO L124 PetriNetUnfolderBase]: 11/86 cut-off events. [2023-12-05 21:04:07,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:07,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 86 events. 11/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2023-12-05 21:04:07,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 73 transitions, 150 flow [2023-12-05 21:04:07,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 73 transitions, 150 flow [2023-12-05 21:04:07,431 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:07,436 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:07,436 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:07,440 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:07,440 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:07,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:07,441 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:07,441 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:07,442 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:07,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1108151473, now seen corresponding path program 1 times [2023-12-05 21:04:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643387931] [2023-12-05 21:04:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:07,641 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:07,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:07,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643387931] [2023-12-05 21:04:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643387931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:07,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773320772] [2023-12-05 21:04:07,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:07,650 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:07,675 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 73 [2023-12-05 21:04:07,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:07,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:07,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 73 [2023-12-05 21:04:07,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:07,701 INFO L124 PetriNetUnfolderBase]: 4/62 cut-off events. [2023-12-05 21:04:07,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:07,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 62 events. 4/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 7/62 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2023-12-05 21:04:07,703 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 7 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-12-05 21:04:07,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 134 flow [2023-12-05 21:04:07,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2023-12-05 21:04:07,719 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7990867579908676 [2023-12-05 21:04:07,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2023-12-05 21:04:07,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2023-12-05 21:04:07,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:07,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2023-12-05 21:04:07,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:07,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:07,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:07,733 INFO L308 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2023-12-05 21:04:07,733 INFO L500 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 134 flow [2023-12-05 21:04:07,733 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:07,733 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:07,733 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:07,734 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:04:07,734 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:07,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1108151474, now seen corresponding path program 1 times [2023-12-05 21:04:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894147991] [2023-12-05 21:04:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:07,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:07,903 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:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:07,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894147991] [2023-12-05 21:04:07,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894147991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583638256] [2023-12-05 21:04:07,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:07,905 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:07,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:07,907 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 73 [2023-12-05 21:04:07,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:07,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:07,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 73 [2023-12-05 21:04:07,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:07,926 INFO L124 PetriNetUnfolderBase]: 4/60 cut-off events. [2023-12-05 21:04:07,926 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-12-05 21:04:07,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 60 events. 4/60 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2023-12-05 21:04:07,927 INFO L140 encePairwiseOnDemand]: 71/73 looper letters, 5 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-12-05 21:04:07,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 142 flow [2023-12-05 21:04:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2023-12-05 21:04:07,934 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.771689497716895 [2023-12-05 21:04:07,935 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 169 transitions. [2023-12-05 21:04:07,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 169 transitions. [2023-12-05 21:04:07,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:07,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 169 transitions. [2023-12-05 21:04:07,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:07,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:07,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 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:07,940 INFO L308 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2023-12-05 21:04:07,940 INFO L500 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 142 flow [2023-12-05 21:04:07,940 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:07,941 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:07,941 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:07,941 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:04:07,941 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:07,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1700098765, now seen corresponding path program 1 times [2023-12-05 21:04:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300437641] [2023-12-05 21:04:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:07,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:07,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:07,993 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:07,994 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:07,995 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:07,996 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:07,996 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:04:07,996 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:07,998 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:07,998 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:04:08,030 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 121 transitions, 252 flow [2023-12-05 21:04:08,053 INFO L124 PetriNetUnfolderBase]: 21/149 cut-off events. [2023-12-05 21:04:08,053 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:08,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 149 events. 21/149 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 349 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 109. Up to 6 conditions per place. [2023-12-05 21:04:08,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 121 transitions, 252 flow [2023-12-05 21:04:08,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 121 transitions, 252 flow [2023-12-05 21:04:08,058 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:08,059 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:08,059 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:08,062 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:08,062 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:08,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:08,062 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,062 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,062 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2075542122, now seen corresponding path program 1 times [2023-12-05 21:04:08,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255242091] [2023-12-05 21:04:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,094 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:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255242091] [2023-12-05 21:04:08,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255242091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775737828] [2023-12-05 21:04:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,095 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,096 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2023-12-05 21:04:08,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:08,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2023-12-05 21:04:08,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:08,123 INFO L124 PetriNetUnfolderBase]: 8/109 cut-off events. [2023-12-05 21:04:08,124 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:08,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 109 events. 8/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 207 event pairs, 0 based on Foata normal form. 13/109 useless extension candidates. Maximal degree in co-relation 87. Up to 9 conditions per place. [2023-12-05 21:04:08,126 INFO L140 encePairwiseOnDemand]: 107/121 looper letters, 8 selfloop transitions, 1 changer transitions 0/97 dead transitions. [2023-12-05 21:04:08,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 222 flow [2023-12-05 21:04:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-12-05 21:04:08,127 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.837465564738292 [2023-12-05 21:04:08,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-12-05 21:04:08,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-12-05 21:04:08,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:08,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-12-05 21:04:08,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 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:08,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 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:08,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 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:08,133 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, -11 predicate places. [2023-12-05 21:04:08,133 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 222 flow [2023-12-05 21:04:08,134 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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:08,134 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,134 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,134 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:04:08,134 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2075542123, now seen corresponding path program 1 times [2023-12-05 21:04:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108333054] [2023-12-05 21:04:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,186 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:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108333054] [2023-12-05 21:04:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108333054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423584622] [2023-12-05 21:04:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,188 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,189 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 121 [2023-12-05 21:04:08,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:08,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 121 [2023-12-05 21:04:08,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:08,209 INFO L124 PetriNetUnfolderBase]: 8/106 cut-off events. [2023-12-05 21:04:08,209 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-12-05 21:04:08,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 106 events. 8/106 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 195 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2023-12-05 21:04:08,210 INFO L140 encePairwiseOnDemand]: 119/121 looper letters, 6 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2023-12-05 21:04:08,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 232 flow [2023-12-05 21:04:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-12-05 21:04:08,212 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8071625344352618 [2023-12-05 21:04:08,212 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-12-05 21:04:08,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-12-05 21:04:08,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:08,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-12-05 21:04:08,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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:08,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 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:08,214 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 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:08,215 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, -10 predicate places. [2023-12-05 21:04:08,215 INFO L500 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 232 flow [2023-12-05 21:04:08,215 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 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:08,215 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,215 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:04:08,216 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2036962861, now seen corresponding path program 1 times [2023-12-05 21:04:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247604499] [2023-12-05 21:04:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:08,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:08,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:08,237 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:08,238 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:08,238 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:08,238 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:08,238 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:04:08,238 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:08,239 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:08,239 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:04:08,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:08,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 169 transitions, 356 flow [2023-12-05 21:04:08,325 INFO L124 PetriNetUnfolderBase]: 31/212 cut-off events. [2023-12-05 21:04:08,325 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:08,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 212 events. 31/212 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 635 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2023-12-05 21:04:08,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 169 transitions, 356 flow [2023-12-05 21:04:08,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 169 transitions, 356 flow [2023-12-05 21:04:08,337 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:08,338 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:08,339 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:08,341 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:08,341 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:08,341 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:08,345 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,345 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,345 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 516052051, now seen corresponding path program 1 times [2023-12-05 21:04:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500284338] [2023-12-05 21:04:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,384 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:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500284338] [2023-12-05 21:04:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500284338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977664408] [2023-12-05 21:04:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,386 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,387 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169 [2023-12-05 21:04:08,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 169 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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:08,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169 [2023-12-05 21:04:08,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:08,422 INFO L124 PetriNetUnfolderBase]: 12/156 cut-off events. [2023-12-05 21:04:08,422 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:08,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 156 events. 12/156 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 401 event pairs, 0 based on Foata normal form. 29/166 useless extension candidates. Maximal degree in co-relation 126. Up to 12 conditions per place. [2023-12-05 21:04:08,425 INFO L140 encePairwiseOnDemand]: 150/169 looper letters, 9 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2023-12-05 21:04:08,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 312 flow [2023-12-05 21:04:08,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-12-05 21:04:08,426 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.854043392504931 [2023-12-05 21:04:08,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-12-05 21:04:08,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-12-05 21:04:08,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:08,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-12-05 21:04:08,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:08,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:08,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:08,431 INFO L308 CegarLoopForPetriNet]: 148 programPoint places, -14 predicate places. [2023-12-05 21:04:08,432 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 312 flow [2023-12-05 21:04:08,432 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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:08,432 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,432 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,432 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:04:08,432 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 516052052, now seen corresponding path program 1 times [2023-12-05 21:04:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304058286] [2023-12-05 21:04:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,482 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:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304058286] [2023-12-05 21:04:08,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304058286] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602568576] [2023-12-05 21:04:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,487 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,491 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 169 [2023-12-05 21:04:08,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:08,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 169 [2023-12-05 21:04:08,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:08,520 INFO L124 PetriNetUnfolderBase]: 12/152 cut-off events. [2023-12-05 21:04:08,521 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-12-05 21:04:08,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 152 events. 12/152 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 382 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-12-05 21:04:08,522 INFO L140 encePairwiseOnDemand]: 167/169 looper letters, 7 selfloop transitions, 1 changer transitions 0/136 dead transitions. [2023-12-05 21:04:08,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 324 flow [2023-12-05 21:04:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-12-05 21:04:08,524 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8224852071005917 [2023-12-05 21:04:08,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-12-05 21:04:08,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-12-05 21:04:08,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:08,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-12-05 21:04:08,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:08,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:08,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 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:08,527 INFO L308 CegarLoopForPetriNet]: 148 programPoint places, -13 predicate places. [2023-12-05 21:04:08,527 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 136 transitions, 324 flow [2023-12-05 21:04:08,528 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 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:08,528 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,528 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,528 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:04:08,528 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2101424110, now seen corresponding path program 1 times [2023-12-05 21:04:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870753494] [2023-12-05 21:04:08,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:08,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:08,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:08,555 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:08,555 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:08,555 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:08,555 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:08,555 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:04:08,555 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:08,556 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:08,556 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:04:08,599 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:08,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 217 transitions, 462 flow [2023-12-05 21:04:08,629 INFO L124 PetriNetUnfolderBase]: 41/275 cut-off events. [2023-12-05 21:04:08,630 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:04:08,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 275 events. 41/275 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 906 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 220. Up to 10 conditions per place. [2023-12-05 21:04:08,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 217 transitions, 462 flow [2023-12-05 21:04:08,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 217 transitions, 462 flow [2023-12-05 21:04:08,639 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:08,640 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:08,640 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:08,641 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:08,642 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:08,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:08,643 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,643 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,643 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,644 INFO L85 PathProgramCache]: Analyzing trace with hash 724648556, now seen corresponding path program 1 times [2023-12-05 21:04:08,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772238167] [2023-12-05 21:04:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,675 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:08,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772238167] [2023-12-05 21:04:08,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772238167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802816369] [2023-12-05 21:04:08,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,677 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,678 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 217 [2023-12-05 21:04:08,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 217 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:08,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 217 [2023-12-05 21:04:08,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:08,720 INFO L124 PetriNetUnfolderBase]: 16/203 cut-off events. [2023-12-05 21:04:08,721 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:04:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 203 events. 16/203 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 594 event pairs, 0 based on Foata normal form. 60/238 useless extension candidates. Maximal degree in co-relation 180. Up to 15 conditions per place. [2023-12-05 21:04:08,723 INFO L140 encePairwiseOnDemand]: 193/217 looper letters, 10 selfloop transitions, 1 changer transitions 0/177 dead transitions. [2023-12-05 21:04:08,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 177 transitions, 404 flow [2023-12-05 21:04:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-12-05 21:04:08,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8632872503840245 [2023-12-05 21:04:08,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-12-05 21:04:08,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-12-05 21:04:08,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:08,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-12-05 21:04:08,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 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:08,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:08,728 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:08,728 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, -17 predicate places. [2023-12-05 21:04:08,728 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 177 transitions, 404 flow [2023-12-05 21:04:08,729 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:08,729 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,729 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:04:08,729 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 724648557, now seen corresponding path program 1 times [2023-12-05 21:04:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550087364] [2023-12-05 21:04:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,767 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:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550087364] [2023-12-05 21:04:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550087364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210448969] [2023-12-05 21:04:08,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,769 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 217 [2023-12-05 21:04:08,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 177 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:08,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 217 [2023-12-05 21:04:08,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:08,804 INFO L124 PetriNetUnfolderBase]: 16/198 cut-off events. [2023-12-05 21:04:08,805 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-12-05 21:04:08,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 198 events. 16/198 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 571 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 183. Up to 10 conditions per place. [2023-12-05 21:04:08,807 INFO L140 encePairwiseOnDemand]: 215/217 looper letters, 8 selfloop transitions, 1 changer transitions 0/176 dead transitions. [2023-12-05 21:04:08,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 176 transitions, 418 flow [2023-12-05 21:04:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-12-05 21:04:08,809 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8310291858678955 [2023-12-05 21:04:08,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-12-05 21:04:08,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-12-05 21:04:08,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:08,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-12-05 21:04:08,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:08,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:08,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:08,813 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, -16 predicate places. [2023-12-05 21:04:08,813 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 176 transitions, 418 flow [2023-12-05 21:04:08,814 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:08,814 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,814 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,814 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:04:08,814 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2044779818, now seen corresponding path program 1 times [2023-12-05 21:04:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839665515] [2023-12-05 21:04:08,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:08,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:08,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:08,849 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:08,849 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:08,849 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:08,850 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:08,850 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:04:08,850 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:08,850 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:08,850 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:04:08,894 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:08,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 265 transitions, 570 flow [2023-12-05 21:04:08,958 INFO L124 PetriNetUnfolderBase]: 51/338 cut-off events. [2023-12-05 21:04:08,958 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:04:08,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 338 events. 51/338 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1188 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 288. Up to 12 conditions per place. [2023-12-05 21:04:08,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 265 transitions, 570 flow [2023-12-05 21:04:08,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 265 transitions, 570 flow [2023-12-05 21:04:08,967 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:08,968 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:08,968 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:08,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:08,969 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:08,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:08,969 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:08,969 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:08,969 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:08,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1593635659, now seen corresponding path program 1 times [2023-12-05 21:04:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:08,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300199018] [2023-12-05 21:04:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:08,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:08,993 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:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300199018] [2023-12-05 21:04:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300199018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:08,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668647528] [2023-12-05 21:04:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:08,994 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:08,995 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2023-12-05 21:04:08,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 265 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:08,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:08,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2023-12-05 21:04:08,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:09,042 INFO L124 PetriNetUnfolderBase]: 20/250 cut-off events. [2023-12-05 21:04:09,043 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:04:09,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 250 events. 20/250 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 784 event pairs, 0 based on Foata normal form. 106/325 useless extension candidates. Maximal degree in co-relation 235. Up to 18 conditions per place. [2023-12-05 21:04:09,046 INFO L140 encePairwiseOnDemand]: 236/265 looper letters, 11 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2023-12-05 21:04:09,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 217 transitions, 498 flow [2023-12-05 21:04:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-12-05 21:04:09,048 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.869182389937107 [2023-12-05 21:04:09,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-12-05 21:04:09,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-12-05 21:04:09,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:09,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-12-05 21:04:09,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:09,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:09,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:09,052 INFO L308 CegarLoopForPetriNet]: 230 programPoint places, -20 predicate places. [2023-12-05 21:04:09,052 INFO L500 AbstractCegarLoop]: Abstraction has has 210 places, 217 transitions, 498 flow [2023-12-05 21:04:09,052 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 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:09,052 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,052 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,052 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:04:09,053 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1593635658, now seen corresponding path program 1 times [2023-12-05 21:04:09,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674256785] [2023-12-05 21:04:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:09,087 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:09,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674256785] [2023-12-05 21:04:09,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674256785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:09,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:09,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128028121] [2023-12-05 21:04:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:09,089 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:09,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:09,091 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 265 [2023-12-05 21:04:09,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 217 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:09,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:09,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 265 [2023-12-05 21:04:09,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:09,138 INFO L124 PetriNetUnfolderBase]: 20/244 cut-off events. [2023-12-05 21:04:09,138 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-12-05 21:04:09,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 244 events. 20/244 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 760 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 238. Up to 12 conditions per place. [2023-12-05 21:04:09,143 INFO L140 encePairwiseOnDemand]: 263/265 looper letters, 9 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2023-12-05 21:04:09,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 216 transitions, 514 flow [2023-12-05 21:04:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2023-12-05 21:04:09,145 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8364779874213837 [2023-12-05 21:04:09,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 665 transitions. [2023-12-05 21:04:09,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 665 transitions. [2023-12-05 21:04:09,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:09,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 665 transitions. [2023-12-05 21:04:09,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 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:09,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:09,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 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:09,149 INFO L308 CegarLoopForPetriNet]: 230 programPoint places, -19 predicate places. [2023-12-05 21:04:09,149 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 216 transitions, 514 flow [2023-12-05 21:04:09,149 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:09,150 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,150 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,150 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:04:09,150 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1664879311, now seen corresponding path program 1 times [2023-12-05 21:04:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458563842] [2023-12-05 21:04:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:09,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:09,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:09,186 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:09,187 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:09,187 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:09,187 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:09,187 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:04:09,187 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:09,188 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:09,188 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:04:09,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:09,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 313 transitions, 680 flow [2023-12-05 21:04:09,295 INFO L124 PetriNetUnfolderBase]: 61/401 cut-off events. [2023-12-05 21:04:09,295 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:04:09,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 401 events. 61/401 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1445 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 357. Up to 14 conditions per place. [2023-12-05 21:04:09,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 271 places, 313 transitions, 680 flow [2023-12-05 21:04:09,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 271 places, 313 transitions, 680 flow [2023-12-05 21:04:09,308 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:09,309 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:09,309 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:09,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:09,310 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:09,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:09,310 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,310 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,310 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2143833298, now seen corresponding path program 1 times [2023-12-05 21:04:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106210953] [2023-12-05 21:04:09,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:09,333 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:09,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:09,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106210953] [2023-12-05 21:04:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106210953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:09,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:09,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:09,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24724598] [2023-12-05 21:04:09,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:09,335 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:09,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:09,337 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 313 [2023-12-05 21:04:09,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 313 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:09,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:09,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 313 [2023-12-05 21:04:09,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:09,424 INFO L124 PetriNetUnfolderBase]: 24/297 cut-off events. [2023-12-05 21:04:09,424 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:04:09,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 297 events. 24/297 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 991 event pairs, 0 based on Foata normal form. 167/427 useless extension candidates. Maximal degree in co-relation 291. Up to 21 conditions per place. [2023-12-05 21:04:09,429 INFO L140 encePairwiseOnDemand]: 279/313 looper letters, 12 selfloop transitions, 1 changer transitions 0/257 dead transitions. [2023-12-05 21:04:09,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 257 transitions, 594 flow [2023-12-05 21:04:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2023-12-05 21:04:09,432 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.873269435569755 [2023-12-05 21:04:09,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 820 transitions. [2023-12-05 21:04:09,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 820 transitions. [2023-12-05 21:04:09,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:09,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 820 transitions. [2023-12-05 21:04:09,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 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:09,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:09,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:09,435 INFO L308 CegarLoopForPetriNet]: 271 programPoint places, -23 predicate places. [2023-12-05 21:04:09,436 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 257 transitions, 594 flow [2023-12-05 21:04:09,436 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:09,436 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,436 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,436 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:04:09,436 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2143833297, now seen corresponding path program 1 times [2023-12-05 21:04:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765485909] [2023-12-05 21:04:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:09,480 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:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765485909] [2023-12-05 21:04:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765485909] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331712477] [2023-12-05 21:04:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:09,481 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:09,482 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 313 [2023-12-05 21:04:09,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 257 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:09,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:09,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 313 [2023-12-05 21:04:09,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:09,533 INFO L124 PetriNetUnfolderBase]: 24/290 cut-off events. [2023-12-05 21:04:09,533 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-12-05 21:04:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 290 events. 24/290 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 951 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 294. Up to 14 conditions per place. [2023-12-05 21:04:09,538 INFO L140 encePairwiseOnDemand]: 311/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2023-12-05 21:04:09,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 256 transitions, 612 flow [2023-12-05 21:04:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2023-12-05 21:04:09,540 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8402555910543131 [2023-12-05 21:04:09,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2023-12-05 21:04:09,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2023-12-05 21:04:09,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:09,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2023-12-05 21:04:09,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 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:09,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:09,543 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:09,544 INFO L308 CegarLoopForPetriNet]: 271 programPoint places, -22 predicate places. [2023-12-05 21:04:09,544 INFO L500 AbstractCegarLoop]: Abstraction has has 249 places, 256 transitions, 612 flow [2023-12-05 21:04:09,544 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:09,544 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,544 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:04:09,544 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1957355737, now seen corresponding path program 1 times [2023-12-05 21:04:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375922319] [2023-12-05 21:04:09,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:09,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:09,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:09,580 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:09,580 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:09,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:09,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:09,581 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:04:09,581 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:09,582 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:09,582 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-05 21:04:09,629 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:09,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 312 places, 361 transitions, 792 flow [2023-12-05 21:04:09,696 INFO L124 PetriNetUnfolderBase]: 71/464 cut-off events. [2023-12-05 21:04:09,696 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:04:09,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 464 events. 71/464 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1711 event pairs, 0 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 427. Up to 16 conditions per place. [2023-12-05 21:04:09,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 312 places, 361 transitions, 792 flow [2023-12-05 21:04:09,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 361 transitions, 792 flow [2023-12-05 21:04:09,712 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:09,712 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:09,712 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:09,714 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:09,714 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:09,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:09,714 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,714 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,714 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,714 INFO L85 PathProgramCache]: Analyzing trace with hash -925944361, now seen corresponding path program 1 times [2023-12-05 21:04:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939193877] [2023-12-05 21:04:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:09,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939193877] [2023-12-05 21:04:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939193877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:09,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679847513] [2023-12-05 21:04:09,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:09,741 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:09,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:09,743 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 361 [2023-12-05 21:04:09,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 361 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:09,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:09,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 361 [2023-12-05 21:04:09,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:09,838 INFO L124 PetriNetUnfolderBase]: 28/344 cut-off events. [2023-12-05 21:04:09,838 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:04:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 344 events. 28/344 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1191 event pairs, 0 based on Foata normal form. 243/544 useless extension candidates. Maximal degree in co-relation 348. Up to 24 conditions per place. [2023-12-05 21:04:09,844 INFO L140 encePairwiseOnDemand]: 322/361 looper letters, 13 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2023-12-05 21:04:09,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 297 transitions, 692 flow [2023-12-05 21:04:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2023-12-05 21:04:09,847 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.876269621421976 [2023-12-05 21:04:09,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 949 transitions. [2023-12-05 21:04:09,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 949 transitions. [2023-12-05 21:04:09,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:09,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 949 transitions. [2023-12-05 21:04:09,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 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:09,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:09,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:09,852 INFO L308 CegarLoopForPetriNet]: 312 programPoint places, -26 predicate places. [2023-12-05 21:04:09,852 INFO L500 AbstractCegarLoop]: Abstraction has has 286 places, 297 transitions, 692 flow [2023-12-05 21:04:09,852 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.0) internal successors, (903), 3 states have internal predecessors, (903), 0 states have call successors, (0), 0 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:09,852 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,852 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:04:09,853 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,853 INFO L85 PathProgramCache]: Analyzing trace with hash -925944360, now seen corresponding path program 1 times [2023-12-05 21:04:09,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963298735] [2023-12-05 21:04:09,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:09,888 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:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963298735] [2023-12-05 21:04:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963298735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:09,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:09,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576270566] [2023-12-05 21:04:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:09,889 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:09,891 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 361 [2023-12-05 21:04:09,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 297 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:09,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:09,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 361 [2023-12-05 21:04:09,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:09,970 INFO L124 PetriNetUnfolderBase]: 28/336 cut-off events. [2023-12-05 21:04:09,970 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-12-05 21:04:09,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 336 events. 28/336 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1144 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 351. Up to 16 conditions per place. [2023-12-05 21:04:09,977 INFO L140 encePairwiseOnDemand]: 359/361 looper letters, 11 selfloop transitions, 1 changer transitions 0/296 dead transitions. [2023-12-05 21:04:09,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 296 transitions, 712 flow [2023-12-05 21:04:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2023-12-05 21:04:09,980 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8430286241920592 [2023-12-05 21:04:09,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2023-12-05 21:04:09,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2023-12-05 21:04:09,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:09,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2023-12-05 21:04:09,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 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:09,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:09,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 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:09,985 INFO L308 CegarLoopForPetriNet]: 312 programPoint places, -25 predicate places. [2023-12-05 21:04:09,985 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 296 transitions, 712 flow [2023-12-05 21:04:09,985 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.6666666666667) internal successors, (905), 3 states have internal predecessors, (905), 0 states have call successors, (0), 0 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:09,985 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:09,986 INFO L233 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:09,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-05 21:04:09,986 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:09,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1203213456, now seen corresponding path program 1 times [2023-12-05 21:04:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520531624] [2023-12-05 21:04:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:10,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:10,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:10,027 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:10,027 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:10,027 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:10,027 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:10,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-05 21:04:10,028 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:10,029 WARN L227 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:10,029 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-12-05 21:04:10,086 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:10,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 409 transitions, 906 flow [2023-12-05 21:04:10,168 INFO L124 PetriNetUnfolderBase]: 81/527 cut-off events. [2023-12-05 21:04:10,168 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-12-05 21:04:10,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 527 events. 81/527 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2005 event pairs, 0 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 499. Up to 18 conditions per place. [2023-12-05 21:04:10,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 409 transitions, 906 flow [2023-12-05 21:04:10,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 353 places, 409 transitions, 906 flow [2023-12-05 21:04:10,189 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:10,190 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:10,190 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:10,191 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:10,192 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:10,192 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:10,192 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:10,192 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:10,192 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:10,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2060031152, now seen corresponding path program 1 times [2023-12-05 21:04:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:10,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216759235] [2023-12-05 21:04:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:10,215 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:10,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:10,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216759235] [2023-12-05 21:04:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216759235] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437099342] [2023-12-05 21:04:10,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:10,216 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:10,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:10,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:10,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:10,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 409 [2023-12-05 21:04:10,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 409 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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:10,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:10,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 409 [2023-12-05 21:04:10,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:10,337 INFO L124 PetriNetUnfolderBase]: 32/391 cut-off events. [2023-12-05 21:04:10,337 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-12-05 21:04:10,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 391 events. 32/391 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1391 event pairs, 0 based on Foata normal form. 334/676 useless extension candidates. Maximal degree in co-relation 406. Up to 27 conditions per place. [2023-12-05 21:04:10,344 INFO L140 encePairwiseOnDemand]: 365/409 looper letters, 14 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2023-12-05 21:04:10,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 337 transitions, 792 flow [2023-12-05 21:04:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1078 transitions. [2023-12-05 21:04:10,347 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8785656071719642 [2023-12-05 21:04:10,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1078 transitions. [2023-12-05 21:04:10,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1078 transitions. [2023-12-05 21:04:10,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:10,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1078 transitions. [2023-12-05 21:04:10,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 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:10,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:10,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:10,351 INFO L308 CegarLoopForPetriNet]: 353 programPoint places, -29 predicate places. [2023-12-05 21:04:10,351 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 337 transitions, 792 flow [2023-12-05 21:04:10,352 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.0) internal successors, (1026), 3 states have internal predecessors, (1026), 0 states have call successors, (0), 0 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:10,352 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:10,352 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:10,352 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-05 21:04:10,352 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:10,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2060031153, now seen corresponding path program 1 times [2023-12-05 21:04:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648804117] [2023-12-05 21:04:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:10,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:10,396 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:10,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:10,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648804117] [2023-12-05 21:04:10,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648804117] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:10,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:10,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413238437] [2023-12-05 21:04:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:10,397 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:10,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:10,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:10,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:10,398 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 409 [2023-12-05 21:04:10,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 337 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:10,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:10,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 409 [2023-12-05 21:04:10,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:10,475 INFO L124 PetriNetUnfolderBase]: 32/382 cut-off events. [2023-12-05 21:04:10,476 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-12-05 21:04:10,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 382 events. 32/382 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1329 event pairs, 0 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 409. Up to 18 conditions per place. [2023-12-05 21:04:10,483 INFO L140 encePairwiseOnDemand]: 407/409 looper letters, 12 selfloop transitions, 1 changer transitions 0/336 dead transitions. [2023-12-05 21:04:10,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 336 transitions, 814 flow [2023-12-05 21:04:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1037 transitions. [2023-12-05 21:04:10,486 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8451507742461287 [2023-12-05 21:04:10,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1037 transitions. [2023-12-05 21:04:10,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1037 transitions. [2023-12-05 21:04:10,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:10,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1037 transitions. [2023-12-05 21:04:10,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 345.6666666666667) internal successors, (1037), 3 states have internal predecessors, (1037), 0 states have call successors, (0), 0 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:10,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:10,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 409.0) internal successors, (1636), 4 states have internal predecessors, (1636), 0 states have call successors, (0), 0 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:10,490 INFO L308 CegarLoopForPetriNet]: 353 programPoint places, -28 predicate places. [2023-12-05 21:04:10,490 INFO L500 AbstractCegarLoop]: Abstraction has has 325 places, 336 transitions, 814 flow [2023-12-05 21:04:10,491 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:10,491 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:10,491 INFO L233 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:10,491 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-05 21:04:10,491 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:10,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:10,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1331563484, now seen corresponding path program 1 times [2023-12-05 21:04:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745272957] [2023-12-05 21:04:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:10,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:10,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:10,530 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:10,530 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:10,530 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:10,531 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:10,531 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-05 21:04:10,531 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:10,532 WARN L227 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:10,532 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2023-12-05 21:04:10,593 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:10,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 394 places, 457 transitions, 1022 flow [2023-12-05 21:04:10,698 INFO L124 PetriNetUnfolderBase]: 91/590 cut-off events. [2023-12-05 21:04:10,699 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-12-05 21:04:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 590 events. 91/590 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2268 event pairs, 0 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 572. Up to 20 conditions per place. [2023-12-05 21:04:10,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 394 places, 457 transitions, 1022 flow [2023-12-05 21:04:10,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 394 places, 457 transitions, 1022 flow [2023-12-05 21:04:10,753 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:10,753 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:10,753 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:10,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:10,754 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-12-05 21:04:10,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:10,755 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:10,755 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:10,755 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:10,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1775841351, now seen corresponding path program 1 times [2023-12-05 21:04:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790454227] [2023-12-05 21:04:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:10,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:10,775 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:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:10,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790454227] [2023-12-05 21:04:10,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790454227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:10,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776604045] [2023-12-05 21:04:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:10,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:10,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:10,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:10,777 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 457 [2023-12-05 21:04:10,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 457 transitions, 1022 flow. Second operand has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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:10,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:10,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 457 [2023-12-05 21:04:10,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:10,881 INFO L124 PetriNetUnfolderBase]: 36/438 cut-off events. [2023-12-05 21:04:10,881 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-12-05 21:04:10,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 438 events. 36/438 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1584 event pairs, 0 based on Foata normal form. 440/823 useless extension candidates. Maximal degree in co-relation 465. Up to 30 conditions per place. [2023-12-05 21:04:10,892 INFO L140 encePairwiseOnDemand]: 408/457 looper letters, 15 selfloop transitions, 1 changer transitions 0/377 dead transitions. [2023-12-05 21:04:10,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 377 transitions, 894 flow [2023-12-05 21:04:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1207 transitions. [2023-12-05 21:04:10,895 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8803792851932896 [2023-12-05 21:04:10,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1207 transitions. [2023-12-05 21:04:10,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1207 transitions. [2023-12-05 21:04:10,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:10,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1207 transitions. [2023-12-05 21:04:10,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 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:10,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:10,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:10,910 INFO L308 CegarLoopForPetriNet]: 394 programPoint places, -32 predicate places. [2023-12-05 21:04:10,910 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 377 transitions, 894 flow [2023-12-05 21:04:10,911 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 0 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:10,911 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:10,911 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:10,911 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-05 21:04:10,912 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:10,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1775841350, now seen corresponding path program 1 times [2023-12-05 21:04:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483553070] [2023-12-05 21:04:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:10,954 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:10,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:10,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483553070] [2023-12-05 21:04:10,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483553070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:10,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:10,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:10,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441466801] [2023-12-05 21:04:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:10,955 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:10,957 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 457 [2023-12-05 21:04:10,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 377 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 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:10,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:10,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 457 [2023-12-05 21:04:10,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:11,057 INFO L124 PetriNetUnfolderBase]: 36/428 cut-off events. [2023-12-05 21:04:11,058 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-12-05 21:04:11,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 428 events. 36/428 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1513 event pairs, 0 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 468. Up to 20 conditions per place. [2023-12-05 21:04:11,068 INFO L140 encePairwiseOnDemand]: 455/457 looper letters, 13 selfloop transitions, 1 changer transitions 0/376 dead transitions. [2023-12-05 21:04:11,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 918 flow [2023-12-05 21:04:11,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions. [2023-12-05 21:04:11,071 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8468271334792122 [2023-12-05 21:04:11,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1161 transitions. [2023-12-05 21:04:11,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1161 transitions. [2023-12-05 21:04:11,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:11,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1161 transitions. [2023-12-05 21:04:11,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 387.0) internal successors, (1161), 3 states have internal predecessors, (1161), 0 states have call successors, (0), 0 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:11,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:11,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 457.0) internal successors, (1828), 4 states have internal predecessors, (1828), 0 states have call successors, (0), 0 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:11,075 INFO L308 CegarLoopForPetriNet]: 394 programPoint places, -31 predicate places. [2023-12-05 21:04:11,075 INFO L500 AbstractCegarLoop]: Abstraction has has 363 places, 376 transitions, 918 flow [2023-12-05 21:04:11,075 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 0 states have call successors, (0), 0 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:11,075 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:11,076 INFO L233 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:11,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-05 21:04:11,076 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:11,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash -504579631, now seen corresponding path program 1 times [2023-12-05 21:04:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:11,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384135699] [2023-12-05 21:04:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:11,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:11,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:11,112 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:11,112 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:11,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:11,112 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:11,112 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-05 21:04:11,113 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:11,113 WARN L227 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:11,113 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2023-12-05 21:04:11,179 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:11,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 435 places, 505 transitions, 1140 flow [2023-12-05 21:04:11,316 INFO L124 PetriNetUnfolderBase]: 101/653 cut-off events. [2023-12-05 21:04:11,316 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-12-05 21:04:11,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 653 events. 101/653 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2547 event pairs, 0 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 646. Up to 22 conditions per place. [2023-12-05 21:04:11,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 435 places, 505 transitions, 1140 flow [2023-12-05 21:04:11,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 435 places, 505 transitions, 1140 flow [2023-12-05 21:04:11,343 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:11,343 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:11,343 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:11,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:11,345 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:11,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:11,345 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:11,345 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:11,345 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:11,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 451340018, now seen corresponding path program 1 times [2023-12-05 21:04:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446899268] [2023-12-05 21:04:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:11,364 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:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:11,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446899268] [2023-12-05 21:04:11,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446899268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:11,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140987244] [2023-12-05 21:04:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:11,365 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:11,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:11,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:11,367 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 505 [2023-12-05 21:04:11,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 505 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:11,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:11,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 505 [2023-12-05 21:04:11,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:11,493 INFO L124 PetriNetUnfolderBase]: 40/485 cut-off events. [2023-12-05 21:04:11,493 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2023-12-05 21:04:11,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 485 events. 40/485 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1787 event pairs, 0 based on Foata normal form. 561/985 useless extension candidates. Maximal degree in co-relation 525. Up to 33 conditions per place. [2023-12-05 21:04:11,510 INFO L140 encePairwiseOnDemand]: 451/505 looper letters, 16 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2023-12-05 21:04:11,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 417 transitions, 998 flow [2023-12-05 21:04:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1336 transitions. [2023-12-05 21:04:11,514 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8818481848184818 [2023-12-05 21:04:11,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1336 transitions. [2023-12-05 21:04:11,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1336 transitions. [2023-12-05 21:04:11,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:11,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1336 transitions. [2023-12-05 21:04:11,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 445.3333333333333) internal successors, (1336), 3 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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:11,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:11,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:11,520 INFO L308 CegarLoopForPetriNet]: 435 programPoint places, -35 predicate places. [2023-12-05 21:04:11,520 INFO L500 AbstractCegarLoop]: Abstraction has has 400 places, 417 transitions, 998 flow [2023-12-05 21:04:11,520 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:11,520 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:11,520 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:11,521 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-05 21:04:11,521 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:11,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash 451340019, now seen corresponding path program 1 times [2023-12-05 21:04:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020224237] [2023-12-05 21:04:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:11,554 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:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:11,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020224237] [2023-12-05 21:04:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020224237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:11,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971587768] [2023-12-05 21:04:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:11,556 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:11,558 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 505 [2023-12-05 21:04:11,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 417 transitions, 998 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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:11,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:11,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 505 [2023-12-05 21:04:11,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:11,707 INFO L124 PetriNetUnfolderBase]: 40/474 cut-off events. [2023-12-05 21:04:11,707 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2023-12-05 21:04:11,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 474 events. 40/474 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1711 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 528. Up to 22 conditions per place. [2023-12-05 21:04:11,717 INFO L140 encePairwiseOnDemand]: 503/505 looper letters, 14 selfloop transitions, 1 changer transitions 0/416 dead transitions. [2023-12-05 21:04:11,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 416 transitions, 1024 flow [2023-12-05 21:04:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2023-12-05 21:04:11,720 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8481848184818482 [2023-12-05 21:04:11,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2023-12-05 21:04:11,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2023-12-05 21:04:11,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:11,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2023-12-05 21:04:11,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:11,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:11,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 505.0) internal successors, (2020), 4 states have internal predecessors, (2020), 0 states have call successors, (0), 0 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:11,725 INFO L308 CegarLoopForPetriNet]: 435 programPoint places, -34 predicate places. [2023-12-05 21:04:11,725 INFO L500 AbstractCegarLoop]: Abstraction has has 401 places, 416 transitions, 1024 flow [2023-12-05 21:04:11,726 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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:11,726 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:11,726 INFO L233 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 10, 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:11,726 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-05 21:04:11,726 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:11,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2074014753, now seen corresponding path program 1 times [2023-12-05 21:04:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916513597] [2023-12-05 21:04:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:11,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:11,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:11,761 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:11,762 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:11,762 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:11,762 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:11,762 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-05 21:04:11,762 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:11,764 WARN L227 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:11,764 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2023-12-05 21:04:11,839 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:11,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 476 places, 553 transitions, 1260 flow [2023-12-05 21:04:11,992 INFO L124 PetriNetUnfolderBase]: 111/716 cut-off events. [2023-12-05 21:04:11,992 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-12-05 21:04:12,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 716 events. 111/716 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2780 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 721. Up to 24 conditions per place. [2023-12-05 21:04:12,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 476 places, 553 transitions, 1260 flow [2023-12-05 21:04:12,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 476 places, 553 transitions, 1260 flow [2023-12-05 21:04:12,030 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:12,030 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:12,030 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:12,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:12,031 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:12,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:12,031 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:12,031 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:12,031 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:12,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash 151640667, now seen corresponding path program 1 times [2023-12-05 21:04:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708095300] [2023-12-05 21:04:12,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:12,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:12,051 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:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708095300] [2023-12-05 21:04:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708095300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834113538] [2023-12-05 21:04:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:12,052 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:12,054 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 553 [2023-12-05 21:04:12,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 553 transitions, 1260 flow. Second operand has 3 states, 3 states have (on average 465.0) internal successors, (1395), 3 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:12,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:12,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 553 [2023-12-05 21:04:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:12,207 INFO L124 PetriNetUnfolderBase]: 44/532 cut-off events. [2023-12-05 21:04:12,207 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-12-05 21:04:12,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 532 events. 44/532 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1984 event pairs, 0 based on Foata normal form. 697/1162 useless extension candidates. Maximal degree in co-relation 586. Up to 36 conditions per place. [2023-12-05 21:04:12,218 INFO L140 encePairwiseOnDemand]: 494/553 looper letters, 17 selfloop transitions, 1 changer transitions 0/457 dead transitions. [2023-12-05 21:04:12,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 457 transitions, 1104 flow [2023-12-05 21:04:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1465 transitions. [2023-12-05 21:04:12,221 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8830620855937311 [2023-12-05 21:04:12,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1465 transitions. [2023-12-05 21:04:12,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1465 transitions. [2023-12-05 21:04:12,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:12,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1465 transitions. [2023-12-05 21:04:12,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 488.3333333333333) internal successors, (1465), 3 states have internal predecessors, (1465), 0 states have call successors, (0), 0 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:12,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:12,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:12,227 INFO L308 CegarLoopForPetriNet]: 476 programPoint places, -38 predicate places. [2023-12-05 21:04:12,227 INFO L500 AbstractCegarLoop]: Abstraction has has 438 places, 457 transitions, 1104 flow [2023-12-05 21:04:12,227 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.0) internal successors, (1395), 3 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:12,227 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:12,227 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:12,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-05 21:04:12,228 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:12,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 151640668, now seen corresponding path program 1 times [2023-12-05 21:04:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195790101] [2023-12-05 21:04:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:12,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:12,268 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:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195790101] [2023-12-05 21:04:12,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195790101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:12,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:12,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199515314] [2023-12-05 21:04:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:12,269 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:12,271 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 553 [2023-12-05 21:04:12,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 457 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 465.6666666666667) internal successors, (1397), 3 states have internal predecessors, (1397), 0 states have call successors, (0), 0 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:12,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:12,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 553 [2023-12-05 21:04:12,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:12,397 INFO L124 PetriNetUnfolderBase]: 44/520 cut-off events. [2023-12-05 21:04:12,398 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES. [2023-12-05 21:04:12,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 520 events. 44/520 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1898 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 589. Up to 24 conditions per place. [2023-12-05 21:04:12,413 INFO L140 encePairwiseOnDemand]: 551/553 looper letters, 15 selfloop transitions, 1 changer transitions 0/456 dead transitions. [2023-12-05 21:04:12,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 456 transitions, 1132 flow [2023-12-05 21:04:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1409 transitions. [2023-12-05 21:04:12,416 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8493068113321278 [2023-12-05 21:04:12,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1409 transitions. [2023-12-05 21:04:12,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1409 transitions. [2023-12-05 21:04:12,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:12,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1409 transitions. [2023-12-05 21:04:12,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 469.6666666666667) internal successors, (1409), 3 states have internal predecessors, (1409), 0 states have call successors, (0), 0 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:12,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:12,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 553.0) internal successors, (2212), 4 states have internal predecessors, (2212), 0 states have call successors, (0), 0 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:12,421 INFO L308 CegarLoopForPetriNet]: 476 programPoint places, -37 predicate places. [2023-12-05 21:04:12,421 INFO L500 AbstractCegarLoop]: Abstraction has has 439 places, 456 transitions, 1132 flow [2023-12-05 21:04:12,422 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 465.6666666666667) internal successors, (1397), 3 states have internal predecessors, (1397), 0 states have call successors, (0), 0 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:12,422 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:12,422 INFO L233 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 11, 11, 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:12,422 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-05 21:04:12,422 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:12,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 187915762, now seen corresponding path program 1 times [2023-12-05 21:04:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:12,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646057542] [2023-12-05 21:04:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:12,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:12,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:12,456 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:12,456 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:12,456 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:12,457 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:12,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-05 21:04:12,457 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:12,457 WARN L227 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:12,457 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2023-12-05 21:04:12,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:12,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 601 transitions, 1382 flow [2023-12-05 21:04:12,741 INFO L124 PetriNetUnfolderBase]: 121/779 cut-off events. [2023-12-05 21:04:12,742 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-12-05 21:04:12,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 779 events. 121/779 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3054 event pairs, 0 based on Foata normal form. 0/619 useless extension candidates. Maximal degree in co-relation 797. Up to 26 conditions per place. [2023-12-05 21:04:12,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 601 transitions, 1382 flow [2023-12-05 21:04:12,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 517 places, 601 transitions, 1382 flow [2023-12-05 21:04:12,762 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:12,763 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:12,763 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:12,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:12,764 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:12,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:12,764 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:12,764 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:12,764 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:12,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1620027892, now seen corresponding path program 1 times [2023-12-05 21:04:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739956661] [2023-12-05 21:04:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:12,781 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:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739956661] [2023-12-05 21:04:12,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739956661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:12,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:12,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:12,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462084963] [2023-12-05 21:04:12,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:12,782 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:12,784 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 504 out of 601 [2023-12-05 21:04:12,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 601 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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:12,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:12,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 504 of 601 [2023-12-05 21:04:12,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:12,933 INFO L124 PetriNetUnfolderBase]: 48/579 cut-off events. [2023-12-05 21:04:12,934 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-12-05 21:04:12,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 579 events. 48/579 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2177 event pairs, 0 based on Foata normal form. 848/1354 useless extension candidates. Maximal degree in co-relation 648. Up to 39 conditions per place. [2023-12-05 21:04:12,952 INFO L140 encePairwiseOnDemand]: 537/601 looper letters, 18 selfloop transitions, 1 changer transitions 0/497 dead transitions. [2023-12-05 21:04:12,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 497 transitions, 1212 flow [2023-12-05 21:04:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1594 transitions. [2023-12-05 21:04:12,955 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8840820854132002 [2023-12-05 21:04:12,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1594 transitions. [2023-12-05 21:04:12,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1594 transitions. [2023-12-05 21:04:12,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:12,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1594 transitions. [2023-12-05 21:04:12,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 531.3333333333334) internal successors, (1594), 3 states have internal predecessors, (1594), 0 states have call successors, (0), 0 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:12,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:12,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:12,960 INFO L308 CegarLoopForPetriNet]: 517 programPoint places, -41 predicate places. [2023-12-05 21:04:12,960 INFO L500 AbstractCegarLoop]: Abstraction has has 476 places, 497 transitions, 1212 flow [2023-12-05 21:04:12,961 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.0) internal successors, (1518), 3 states have internal predecessors, (1518), 0 states have call successors, (0), 0 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:12,961 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:12,961 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:12,961 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-05 21:04:12,961 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:12,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1620027893, now seen corresponding path program 1 times [2023-12-05 21:04:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527388562] [2023-12-05 21:04:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:12,995 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:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527388562] [2023-12-05 21:04:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527388562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737486482] [2023-12-05 21:04:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:12,995 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:12,997 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 601 [2023-12-05 21:04:12,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 497 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 0 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:12,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:12,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 601 [2023-12-05 21:04:12,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:13,259 INFO L124 PetriNetUnfolderBase]: 48/566 cut-off events. [2023-12-05 21:04:13,259 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-12-05 21:04:13,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 566 events. 48/566 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2100 event pairs, 0 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 651. Up to 26 conditions per place. [2023-12-05 21:04:13,280 INFO L140 encePairwiseOnDemand]: 599/601 looper letters, 16 selfloop transitions, 1 changer transitions 0/496 dead transitions. [2023-12-05 21:04:13,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 496 transitions, 1242 flow [2023-12-05 21:04:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1533 transitions. [2023-12-05 21:04:13,283 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8502495840266223 [2023-12-05 21:04:13,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1533 transitions. [2023-12-05 21:04:13,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1533 transitions. [2023-12-05 21:04:13,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:13,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1533 transitions. [2023-12-05 21:04:13,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 511.0) internal successors, (1533), 3 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:13,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:13,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 601.0) internal successors, (2404), 4 states have internal predecessors, (2404), 0 states have call successors, (0), 0 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:13,289 INFO L308 CegarLoopForPetriNet]: 517 programPoint places, -40 predicate places. [2023-12-05 21:04:13,289 INFO L500 AbstractCegarLoop]: Abstraction has has 477 places, 496 transitions, 1242 flow [2023-12-05 21:04:13,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.6666666666667) internal successors, (1520), 3 states have internal predecessors, (1520), 0 states have call successors, (0), 0 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:13,289 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:13,289 INFO L233 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 12, 12, 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:13,289 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-05 21:04:13,289 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:13,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1138772194, now seen corresponding path program 1 times [2023-12-05 21:04:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551113108] [2023-12-05 21:04:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:13,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:13,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:13,333 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:13,333 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:13,333 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:13,333 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:13,333 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-05 21:04:13,333 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:13,335 WARN L227 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:13,335 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2023-12-05 21:04:13,425 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:13,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 558 places, 649 transitions, 1506 flow [2023-12-05 21:04:13,612 INFO L124 PetriNetUnfolderBase]: 131/842 cut-off events. [2023-12-05 21:04:13,612 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2023-12-05 21:04:13,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 842 events. 131/842 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3320 event pairs, 0 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 874. Up to 28 conditions per place. [2023-12-05 21:04:13,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 558 places, 649 transitions, 1506 flow [2023-12-05 21:04:13,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 558 places, 649 transitions, 1506 flow [2023-12-05 21:04:13,655 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:13,655 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:13,655 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:13,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:13,656 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:13,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:13,657 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:13,657 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:13,657 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:13,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 561534397, now seen corresponding path program 1 times [2023-12-05 21:04:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479601914] [2023-12-05 21:04:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:13,674 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:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479601914] [2023-12-05 21:04:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479601914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:13,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:13,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639007378] [2023-12-05 21:04:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:13,675 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:13,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:13,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:13,677 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 649 [2023-12-05 21:04:13,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 649 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 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:13,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:13,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 649 [2023-12-05 21:04:13,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:13,894 INFO L124 PetriNetUnfolderBase]: 52/626 cut-off events. [2023-12-05 21:04:13,895 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2023-12-05 21:04:13,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 626 events. 52/626 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2379 event pairs, 0 based on Foata normal form. 1014/1561 useless extension candidates. Maximal degree in co-relation 712. Up to 42 conditions per place. [2023-12-05 21:04:13,909 INFO L140 encePairwiseOnDemand]: 580/649 looper letters, 19 selfloop transitions, 1 changer transitions 0/537 dead transitions. [2023-12-05 21:04:13,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 537 transitions, 1322 flow [2023-12-05 21:04:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1723 transitions. [2023-12-05 21:04:13,912 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8849512069851053 [2023-12-05 21:04:13,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1723 transitions. [2023-12-05 21:04:13,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1723 transitions. [2023-12-05 21:04:13,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:13,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1723 transitions. [2023-12-05 21:04:13,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 574.3333333333334) internal successors, (1723), 3 states have internal predecessors, (1723), 0 states have call successors, (0), 0 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:13,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:13,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:13,918 INFO L308 CegarLoopForPetriNet]: 558 programPoint places, -44 predicate places. [2023-12-05 21:04:13,918 INFO L500 AbstractCegarLoop]: Abstraction has has 514 places, 537 transitions, 1322 flow [2023-12-05 21:04:13,919 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.0) internal successors, (1641), 3 states have internal predecessors, (1641), 0 states have call successors, (0), 0 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:13,919 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:13,919 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:13,919 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-05 21:04:13,919 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:13,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash 561534398, now seen corresponding path program 1 times [2023-12-05 21:04:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698195466] [2023-12-05 21:04:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:13,948 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:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698195466] [2023-12-05 21:04:13,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698195466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076951118] [2023-12-05 21:04:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:13,949 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:13,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:13,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:13,951 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 649 [2023-12-05 21:04:13,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 537 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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:13,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:13,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 649 [2023-12-05 21:04:13,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:14,157 INFO L124 PetriNetUnfolderBase]: 52/612 cut-off events. [2023-12-05 21:04:14,158 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-12-05 21:04:14,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 612 events. 52/612 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2275 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 714. Up to 28 conditions per place. [2023-12-05 21:04:14,179 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 17 selfloop transitions, 1 changer transitions 0/536 dead transitions. [2023-12-05 21:04:14,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 536 transitions, 1354 flow [2023-12-05 21:04:14,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2023-12-05 21:04:14,183 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8510529019003595 [2023-12-05 21:04:14,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1657 transitions. [2023-12-05 21:04:14,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1657 transitions. [2023-12-05 21:04:14,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:14,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1657 transitions. [2023-12-05 21:04:14,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 552.3333333333334) internal successors, (1657), 3 states have internal predecessors, (1657), 0 states have call successors, (0), 0 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:14,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:14,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 649.0) internal successors, (2596), 4 states have internal predecessors, (2596), 0 states have call successors, (0), 0 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:14,189 INFO L308 CegarLoopForPetriNet]: 558 programPoint places, -43 predicate places. [2023-12-05 21:04:14,189 INFO L500 AbstractCegarLoop]: Abstraction has has 515 places, 536 transitions, 1354 flow [2023-12-05 21:04:14,189 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.6666666666666) internal successors, (1643), 3 states have internal predecessors, (1643), 0 states have call successors, (0), 0 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:14,190 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:14,190 INFO L233 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 13, 13, 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:14,190 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-05 21:04:14,190 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:14,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash -978665517, now seen corresponding path program 1 times [2023-12-05 21:04:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220482592] [2023-12-05 21:04:14,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:14,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:14,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:14,226 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:14,226 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:14,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:14,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:14,227 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-05 21:04:14,227 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:14,227 WARN L227 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:14,227 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2023-12-05 21:04:14,297 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:14,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 697 transitions, 1632 flow [2023-12-05 21:04:14,495 INFO L124 PetriNetUnfolderBase]: 141/905 cut-off events. [2023-12-05 21:04:14,495 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-12-05 21:04:14,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 905 events. 141/905 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3604 event pairs, 0 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 952. Up to 30 conditions per place. [2023-12-05 21:04:14,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 697 transitions, 1632 flow [2023-12-05 21:04:14,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 599 places, 697 transitions, 1632 flow [2023-12-05 21:04:14,566 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:14,567 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:14,567 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:14,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:14,568 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:14,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:14,568 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:14,568 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:14,568 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:14,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1271127478, now seen corresponding path program 1 times [2023-12-05 21:04:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130407541] [2023-12-05 21:04:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:14,585 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:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130407541] [2023-12-05 21:04:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130407541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967691211] [2023-12-05 21:04:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:14,586 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:14,588 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 697 [2023-12-05 21:04:14,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 697 transitions, 1632 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 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:14,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:14,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 697 [2023-12-05 21:04:14,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:14,786 INFO L124 PetriNetUnfolderBase]: 56/673 cut-off events. [2023-12-05 21:04:14,786 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-12-05 21:04:14,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 673 events. 56/673 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2576 event pairs, 0 based on Foata normal form. 1195/1783 useless extension candidates. Maximal degree in co-relation 777. Up to 45 conditions per place. [2023-12-05 21:04:14,813 INFO L140 encePairwiseOnDemand]: 623/697 looper letters, 20 selfloop transitions, 1 changer transitions 0/577 dead transitions. [2023-12-05 21:04:14,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 577 transitions, 1434 flow [2023-12-05 21:04:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1852 transitions. [2023-12-05 21:04:14,817 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8857006217120995 [2023-12-05 21:04:14,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1852 transitions. [2023-12-05 21:04:14,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1852 transitions. [2023-12-05 21:04:14,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:14,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1852 transitions. [2023-12-05 21:04:14,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:14,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:14,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:14,822 INFO L308 CegarLoopForPetriNet]: 599 programPoint places, -47 predicate places. [2023-12-05 21:04:14,823 INFO L500 AbstractCegarLoop]: Abstraction has has 552 places, 577 transitions, 1434 flow [2023-12-05 21:04:14,823 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 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:14,823 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:14,823 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:14,823 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-05 21:04:14,823 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:14,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1271127479, now seen corresponding path program 1 times [2023-12-05 21:04:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:14,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365433157] [2023-12-05 21:04:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:14,848 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:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365433157] [2023-12-05 21:04:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365433157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422053862] [2023-12-05 21:04:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:14,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:14,850 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 697 [2023-12-05 21:04:14,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 577 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 588.6666666666666) internal successors, (1766), 3 states have internal predecessors, (1766), 0 states have call successors, (0), 0 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:14,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:14,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 697 [2023-12-05 21:04:14,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:15,039 INFO L124 PetriNetUnfolderBase]: 56/658 cut-off events. [2023-12-05 21:04:15,039 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2023-12-05 21:04:15,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 658 events. 56/658 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2464 event pairs, 0 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 778. Up to 30 conditions per place. [2023-12-05 21:04:15,064 INFO L140 encePairwiseOnDemand]: 695/697 looper letters, 18 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2023-12-05 21:04:15,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 576 transitions, 1468 flow [2023-12-05 21:04:15,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:15,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1781 transitions. [2023-12-05 21:04:15,067 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8517455762792921 [2023-12-05 21:04:15,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1781 transitions. [2023-12-05 21:04:15,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1781 transitions. [2023-12-05 21:04:15,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:15,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1781 transitions. [2023-12-05 21:04:15,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 593.6666666666666) internal successors, (1781), 3 states have internal predecessors, (1781), 0 states have call successors, (0), 0 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:15,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:15,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 697.0) internal successors, (2788), 4 states have internal predecessors, (2788), 0 states have call successors, (0), 0 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:15,075 INFO L308 CegarLoopForPetriNet]: 599 programPoint places, -46 predicate places. [2023-12-05 21:04:15,075 INFO L500 AbstractCegarLoop]: Abstraction has has 553 places, 576 transitions, 1468 flow [2023-12-05 21:04:15,076 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.6666666666666) internal successors, (1766), 3 states have internal predecessors, (1766), 0 states have call successors, (0), 0 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:15,076 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,076 INFO L233 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 14, 14, 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:15,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-05 21:04:15,076 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:15,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1896622821, now seen corresponding path program 1 times [2023-12-05 21:04:15,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624514940] [2023-12-05 21:04:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:15,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:15,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:15,132 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:15,133 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:15,133 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:15,133 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:15,133 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-05 21:04:15,133 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:15,133 WARN L227 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:15,133 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2023-12-05 21:04:15,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:15,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 640 places, 745 transitions, 1760 flow [2023-12-05 21:04:15,471 INFO L124 PetriNetUnfolderBase]: 151/968 cut-off events. [2023-12-05 21:04:15,471 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2023-12-05 21:04:15,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 968 events. 151/968 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3872 event pairs, 0 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1031. Up to 32 conditions per place. [2023-12-05 21:04:15,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 640 places, 745 transitions, 1760 flow [2023-12-05 21:04:15,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 640 places, 745 transitions, 1760 flow [2023-12-05 21:04:15,529 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:15,529 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:15,529 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:15,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:15,530 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:15,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:15,531 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,531 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:15,531 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:15,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash -546160161, now seen corresponding path program 1 times [2023-12-05 21:04:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510350325] [2023-12-05 21:04:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:15,557 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:15,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:15,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510350325] [2023-12-05 21:04:15,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510350325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:15,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:15,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:15,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171190273] [2023-12-05 21:04:15,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:15,558 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:15,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:15,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:15,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:15,560 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 627 out of 745 [2023-12-05 21:04:15,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 745 transitions, 1760 flow. Second operand has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:15,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:15,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 627 of 745 [2023-12-05 21:04:15,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:15,789 INFO L124 PetriNetUnfolderBase]: 60/720 cut-off events. [2023-12-05 21:04:15,789 INFO L125 PetriNetUnfolderBase]: For 665/665 co-relation queries the response was YES. [2023-12-05 21:04:15,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 720 events. 60/720 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2765 event pairs, 0 based on Foata normal form. 1391/2020 useless extension candidates. Maximal degree in co-relation 843. Up to 48 conditions per place. [2023-12-05 21:04:15,820 INFO L140 encePairwiseOnDemand]: 666/745 looper letters, 21 selfloop transitions, 1 changer transitions 0/617 dead transitions. [2023-12-05 21:04:15,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 617 transitions, 1548 flow [2023-12-05 21:04:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions. [2023-12-05 21:04:15,824 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8863534675615212 [2023-12-05 21:04:15,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1981 transitions. [2023-12-05 21:04:15,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1981 transitions. [2023-12-05 21:04:15,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:15,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1981 transitions. [2023-12-05 21:04:15,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 0 states have call successors, (0), 0 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:15,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:15,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:15,832 INFO L308 CegarLoopForPetriNet]: 640 programPoint places, -50 predicate places. [2023-12-05 21:04:15,832 INFO L500 AbstractCegarLoop]: Abstraction has has 590 places, 617 transitions, 1548 flow [2023-12-05 21:04:15,832 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.0) internal successors, (1887), 3 states have internal predecessors, (1887), 0 states have call successors, (0), 0 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:15,832 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,832 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:15,832 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-05 21:04:15,833 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:15,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash -546160160, now seen corresponding path program 1 times [2023-12-05 21:04:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155626354] [2023-12-05 21:04:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:15,859 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:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155626354] [2023-12-05 21:04:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155626354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580134330] [2023-12-05 21:04:15,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:15,861 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:15,863 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 745 [2023-12-05 21:04:15,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 617 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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:15,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:15,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 745 [2023-12-05 21:04:15,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:16,108 INFO L124 PetriNetUnfolderBase]: 60/704 cut-off events. [2023-12-05 21:04:16,108 INFO L125 PetriNetUnfolderBase]: For 684/684 co-relation queries the response was YES. [2023-12-05 21:04:16,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 704 events. 60/704 cut-off events. For 684/684 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2669 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 843. Up to 32 conditions per place. [2023-12-05 21:04:16,138 INFO L140 encePairwiseOnDemand]: 743/745 looper letters, 19 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2023-12-05 21:04:16,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 616 transitions, 1584 flow [2023-12-05 21:04:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1905 transitions. [2023-12-05 21:04:16,142 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8523489932885906 [2023-12-05 21:04:16,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1905 transitions. [2023-12-05 21:04:16,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1905 transitions. [2023-12-05 21:04:16,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:16,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1905 transitions. [2023-12-05 21:04:16,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 635.0) internal successors, (1905), 3 states have internal predecessors, (1905), 0 states have call successors, (0), 0 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:16,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:16,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 745.0) internal successors, (2980), 4 states have internal predecessors, (2980), 0 states have call successors, (0), 0 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:16,150 INFO L308 CegarLoopForPetriNet]: 640 programPoint places, -49 predicate places. [2023-12-05 21:04:16,150 INFO L500 AbstractCegarLoop]: Abstraction has has 591 places, 616 transitions, 1584 flow [2023-12-05 21:04:16,150 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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:16,150 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:16,150 INFO L233 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 15, 15, 1, 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:16,151 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-05 21:04:16,151 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:16,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1248151412, now seen corresponding path program 1 times [2023-12-05 21:04:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832251065] [2023-12-05 21:04:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:16,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:16,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:16,191 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:16,192 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:16,192 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:16,192 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:16,192 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-05 21:04:16,192 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:16,192 WARN L227 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:16,192 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2023-12-05 21:04:16,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 681 places, 793 transitions, 1890 flow [2023-12-05 21:04:16,605 INFO L124 PetriNetUnfolderBase]: 161/1031 cut-off events. [2023-12-05 21:04:16,605 INFO L125 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2023-12-05 21:04:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1031 events. 161/1031 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4127 event pairs, 0 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1111. Up to 34 conditions per place. [2023-12-05 21:04:16,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 681 places, 793 transitions, 1890 flow [2023-12-05 21:04:16,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 681 places, 793 transitions, 1890 flow [2023-12-05 21:04:16,658 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:16,658 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:16,658 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:16,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:16,660 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:16,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:16,660 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:16,660 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:16,660 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:16,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -595361224, now seen corresponding path program 1 times [2023-12-05 21:04:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:16,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546645878] [2023-12-05 21:04:16,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:16,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:16,682 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:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546645878] [2023-12-05 21:04:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546645878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769754348] [2023-12-05 21:04:16,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:16,683 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:16,685 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 793 [2023-12-05 21:04:16,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 793 transitions, 1890 flow. Second operand has 3 states, 3 states have (on average 670.0) internal successors, (2010), 3 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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:16,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:16,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 793 [2023-12-05 21:04:16,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:16,982 INFO L124 PetriNetUnfolderBase]: 64/767 cut-off events. [2023-12-05 21:04:16,982 INFO L125 PetriNetUnfolderBase]: For 800/800 co-relation queries the response was YES. [2023-12-05 21:04:17,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 767 events. 64/767 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2969 event pairs, 0 based on Foata normal form. 1602/2272 useless extension candidates. Maximal degree in co-relation 910. Up to 51 conditions per place. [2023-12-05 21:04:17,021 INFO L140 encePairwiseOnDemand]: 709/793 looper letters, 22 selfloop transitions, 1 changer transitions 0/657 dead transitions. [2023-12-05 21:04:17,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 657 transitions, 1664 flow [2023-12-05 21:04:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2110 transitions. [2023-12-05 21:04:17,025 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8869272803699033 [2023-12-05 21:04:17,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2110 transitions. [2023-12-05 21:04:17,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2110 transitions. [2023-12-05 21:04:17,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:17,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2110 transitions. [2023-12-05 21:04:17,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 703.3333333333334) internal successors, (2110), 3 states have internal predecessors, (2110), 0 states have call successors, (0), 0 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:17,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:17,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:17,031 INFO L308 CegarLoopForPetriNet]: 681 programPoint places, -53 predicate places. [2023-12-05 21:04:17,031 INFO L500 AbstractCegarLoop]: Abstraction has has 628 places, 657 transitions, 1664 flow [2023-12-05 21:04:17,032 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 670.0) internal successors, (2010), 3 states have internal predecessors, (2010), 0 states have call successors, (0), 0 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:17,032 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:17,032 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:17,032 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-05 21:04:17,032 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:17,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:17,032 INFO L85 PathProgramCache]: Analyzing trace with hash -595361223, now seen corresponding path program 1 times [2023-12-05 21:04:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:17,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868290946] [2023-12-05 21:04:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:17,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:17,063 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:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:17,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868290946] [2023-12-05 21:04:17,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868290946] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:17,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:17,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464272617] [2023-12-05 21:04:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:17,064 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:17,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:17,066 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 669 out of 793 [2023-12-05 21:04:17,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 657 transitions, 1664 flow. Second operand has 3 states, 3 states have (on average 670.6666666666666) internal successors, (2012), 3 states have internal predecessors, (2012), 0 states have call successors, (0), 0 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:17,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:17,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 669 of 793 [2023-12-05 21:04:17,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:17,335 INFO L124 PetriNetUnfolderBase]: 64/750 cut-off events. [2023-12-05 21:04:17,336 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2023-12-05 21:04:17,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 750 events. 64/750 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 2840 event pairs, 0 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 909. Up to 34 conditions per place. [2023-12-05 21:04:17,370 INFO L140 encePairwiseOnDemand]: 791/793 looper letters, 20 selfloop transitions, 1 changer transitions 0/656 dead transitions. [2023-12-05 21:04:17,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 656 transitions, 1702 flow [2023-12-05 21:04:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2023-12-05 21:04:17,373 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8528793610760824 [2023-12-05 21:04:17,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2029 transitions. [2023-12-05 21:04:17,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2029 transitions. [2023-12-05 21:04:17,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:17,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2029 transitions. [2023-12-05 21:04:17,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 676.3333333333334) internal successors, (2029), 3 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:17,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:17,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 793.0) internal successors, (3172), 4 states have internal predecessors, (3172), 0 states have call successors, (0), 0 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:17,378 INFO L308 CegarLoopForPetriNet]: 681 programPoint places, -52 predicate places. [2023-12-05 21:04:17,378 INFO L500 AbstractCegarLoop]: Abstraction has has 629 places, 656 transitions, 1702 flow [2023-12-05 21:04:17,378 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 670.6666666666666) internal successors, (2012), 3 states have internal predecessors, (2012), 0 states have call successors, (0), 0 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:17,378 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:17,378 INFO L233 CegarLoopForPetriNet]: trace histogram [17, 17, 17, 17, 16, 16, 1, 1, 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:17,378 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-05 21:04:17,379 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:17,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:17,379 INFO L85 PathProgramCache]: Analyzing trace with hash -857283048, now seen corresponding path program 1 times [2023-12-05 21:04:17,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:17,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110672057] [2023-12-05 21:04:17,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:17,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:17,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:17,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:17,421 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:17,421 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:17,421 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:17,422 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:17,422 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-05 21:04:17,422 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:17,422 WARN L227 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:17,422 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2023-12-05 21:04:17,499 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:17,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 722 places, 841 transitions, 2022 flow [2023-12-05 21:04:17,838 INFO L124 PetriNetUnfolderBase]: 171/1094 cut-off events. [2023-12-05 21:04:17,838 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-12-05 21:04:17,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 1094 events. 171/1094 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4409 event pairs, 0 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1192. Up to 36 conditions per place. [2023-12-05 21:04:17,881 INFO L82 GeneralOperation]: Start removeDead. Operand has 722 places, 841 transitions, 2022 flow [2023-12-05 21:04:17,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 722 places, 841 transitions, 2022 flow [2023-12-05 21:04:17,901 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:17,901 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:17,901 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:17,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:17,902 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:17,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:17,902 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:17,902 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:17,902 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:17,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1123524289, now seen corresponding path program 1 times [2023-12-05 21:04:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406663074] [2023-12-05 21:04:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:17,920 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:17,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406663074] [2023-12-05 21:04:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406663074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:17,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771704247] [2023-12-05 21:04:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:17,921 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:17,923 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 841 [2023-12-05 21:04:17,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 841 transitions, 2022 flow. Second operand has 3 states, 3 states have (on average 711.0) internal successors, (2133), 3 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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:17,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:17,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 841 [2023-12-05 21:04:17,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:18,196 INFO L124 PetriNetUnfolderBase]: 68/814 cut-off events. [2023-12-05 21:04:18,197 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2023-12-05 21:04:18,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 814 events. 68/814 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3145 event pairs, 0 based on Foata normal form. 1828/2539 useless extension candidates. Maximal degree in co-relation 978. Up to 54 conditions per place. [2023-12-05 21:04:18,238 INFO L140 encePairwiseOnDemand]: 752/841 looper letters, 23 selfloop transitions, 1 changer transitions 0/697 dead transitions. [2023-12-05 21:04:18,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 697 transitions, 1782 flow [2023-12-05 21:04:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2023-12-05 21:04:18,241 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8874355925485533 [2023-12-05 21:04:18,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2239 transitions. [2023-12-05 21:04:18,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2239 transitions. [2023-12-05 21:04:18,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:18,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2239 transitions. [2023-12-05 21:04:18,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 746.3333333333334) internal successors, (2239), 3 states have internal predecessors, (2239), 0 states have call successors, (0), 0 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:18,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:18,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:18,248 INFO L308 CegarLoopForPetriNet]: 722 programPoint places, -56 predicate places. [2023-12-05 21:04:18,248 INFO L500 AbstractCegarLoop]: Abstraction has has 666 places, 697 transitions, 1782 flow [2023-12-05 21:04:18,248 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.0) internal successors, (2133), 3 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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:18,248 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:18,248 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:18,248 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-12-05 21:04:18,248 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:18,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1123524290, now seen corresponding path program 1 times [2023-12-05 21:04:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039278271] [2023-12-05 21:04:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:18,273 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:18,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039278271] [2023-12-05 21:04:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039278271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:18,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:18,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:18,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149483032] [2023-12-05 21:04:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:18,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:18,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:18,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:18,276 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 841 [2023-12-05 21:04:18,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 697 transitions, 1782 flow. Second operand has 3 states, 3 states have (on average 711.6666666666666) internal successors, (2135), 3 states have internal predecessors, (2135), 0 states have call successors, (0), 0 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:18,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:18,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 841 [2023-12-05 21:04:18,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:18,534 INFO L124 PetriNetUnfolderBase]: 68/796 cut-off events. [2023-12-05 21:04:18,535 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-12-05 21:04:18,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 796 events. 68/796 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3041 event pairs, 0 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 977. Up to 36 conditions per place. [2023-12-05 21:04:18,573 INFO L140 encePairwiseOnDemand]: 839/841 looper letters, 21 selfloop transitions, 1 changer transitions 0/696 dead transitions. [2023-12-05 21:04:18,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 696 transitions, 1822 flow [2023-12-05 21:04:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2023-12-05 21:04:18,576 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8533491874752279 [2023-12-05 21:04:18,576 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2153 transitions. [2023-12-05 21:04:18,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2153 transitions. [2023-12-05 21:04:18,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:18,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2153 transitions. [2023-12-05 21:04:18,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 717.6666666666666) internal successors, (2153), 3 states have internal predecessors, (2153), 0 states have call successors, (0), 0 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:18,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:18,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 841.0) internal successors, (3364), 4 states have internal predecessors, (3364), 0 states have call successors, (0), 0 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:18,582 INFO L308 CegarLoopForPetriNet]: 722 programPoint places, -55 predicate places. [2023-12-05 21:04:18,582 INFO L500 AbstractCegarLoop]: Abstraction has has 667 places, 696 transitions, 1822 flow [2023-12-05 21:04:18,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.6666666666666) internal successors, (2135), 3 states have internal predecessors, (2135), 0 states have call successors, (0), 0 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:18,582 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:18,582 INFO L233 CegarLoopForPetriNet]: trace histogram [18, 18, 18, 18, 17, 17, 1, 1, 1, 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:18,583 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-12-05 21:04:18,583 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:18,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1526291669, now seen corresponding path program 1 times [2023-12-05 21:04:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289367344] [2023-12-05 21:04:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:18,605 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:18,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:18,675 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:18,675 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:18,675 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:18,675 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:18,676 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-12-05 21:04:18,676 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:18,676 WARN L227 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:18,676 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2023-12-05 21:04:18,759 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:18,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 763 places, 889 transitions, 2156 flow [2023-12-05 21:04:19,129 INFO L124 PetriNetUnfolderBase]: 181/1157 cut-off events. [2023-12-05 21:04:19,129 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-12-05 21:04:19,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1157 events. 181/1157 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4659 event pairs, 0 based on Foata normal form. 0/919 useless extension candidates. Maximal degree in co-relation 1274. Up to 38 conditions per place. [2023-12-05 21:04:19,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 763 places, 889 transitions, 2156 flow [2023-12-05 21:04:19,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 763 places, 889 transitions, 2156 flow [2023-12-05 21:04:19,219 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:19,219 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:19,219 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:19,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:19,221 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:19,221 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:19,221 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:19,221 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:19,221 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:19,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:19,221 INFO L85 PathProgramCache]: Analyzing trace with hash 315529082, now seen corresponding path program 1 times [2023-12-05 21:04:19,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:19,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333213274] [2023-12-05 21:04:19,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:19,239 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:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:19,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333213274] [2023-12-05 21:04:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333213274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:19,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:19,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:19,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521910237] [2023-12-05 21:04:19,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:19,240 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:19,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:19,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:19,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:19,242 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 889 [2023-12-05 21:04:19,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 889 transitions, 2156 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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:19,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:19,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 889 [2023-12-05 21:04:19,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:19,559 INFO L124 PetriNetUnfolderBase]: 72/861 cut-off events. [2023-12-05 21:04:19,559 INFO L125 PetriNetUnfolderBase]: For 1122/1122 co-relation queries the response was YES. [2023-12-05 21:04:19,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 861 events. 72/861 cut-off events. For 1122/1122 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3339 event pairs, 0 based on Foata normal form. 2069/2821 useless extension candidates. Maximal degree in co-relation 1047. Up to 57 conditions per place. [2023-12-05 21:04:19,603 INFO L140 encePairwiseOnDemand]: 795/889 looper letters, 24 selfloop transitions, 1 changer transitions 0/737 dead transitions. [2023-12-05 21:04:19,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 737 transitions, 1902 flow [2023-12-05 21:04:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2368 transitions. [2023-12-05 21:04:19,606 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8878890138732658 [2023-12-05 21:04:19,606 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2368 transitions. [2023-12-05 21:04:19,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2368 transitions. [2023-12-05 21:04:19,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:19,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2368 transitions. [2023-12-05 21:04:19,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 789.3333333333334) internal successors, (2368), 3 states have internal predecessors, (2368), 0 states have call successors, (0), 0 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:19,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:19,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:19,612 INFO L308 CegarLoopForPetriNet]: 763 programPoint places, -59 predicate places. [2023-12-05 21:04:19,612 INFO L500 AbstractCegarLoop]: Abstraction has has 704 places, 737 transitions, 1902 flow [2023-12-05 21:04:19,612 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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:19,612 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:19,612 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:19,612 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-12-05 21:04:19,612 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:19,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash 315529083, now seen corresponding path program 1 times [2023-12-05 21:04:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512764098] [2023-12-05 21:04:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:19,636 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:19,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:19,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512764098] [2023-12-05 21:04:19,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512764098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:19,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:19,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:19,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262815650] [2023-12-05 21:04:19,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:19,637 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:19,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:19,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:19,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:19,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 889 [2023-12-05 21:04:19,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 737 transitions, 1902 flow. Second operand has 3 states, 3 states have (on average 752.6666666666666) internal successors, (2258), 3 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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:19,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:19,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 889 [2023-12-05 21:04:19,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:19,975 INFO L124 PetriNetUnfolderBase]: 72/842 cut-off events. [2023-12-05 21:04:19,975 INFO L125 PetriNetUnfolderBase]: For 1144/1144 co-relation queries the response was YES. [2023-12-05 21:04:20,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 842 events. 72/842 cut-off events. For 1144/1144 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3228 event pairs, 0 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1046. Up to 38 conditions per place. [2023-12-05 21:04:20,016 INFO L140 encePairwiseOnDemand]: 887/889 looper letters, 22 selfloop transitions, 1 changer transitions 0/736 dead transitions. [2023-12-05 21:04:20,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 736 transitions, 1944 flow [2023-12-05 21:04:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2023-12-05 21:04:20,018 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8537682789651294 [2023-12-05 21:04:20,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2277 transitions. [2023-12-05 21:04:20,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2277 transitions. [2023-12-05 21:04:20,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:20,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2277 transitions. [2023-12-05 21:04:20,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 759.0) internal successors, (2277), 3 states have internal predecessors, (2277), 0 states have call successors, (0), 0 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:20,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:20,051 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 889.0) internal successors, (3556), 4 states have internal predecessors, (3556), 0 states have call successors, (0), 0 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:20,051 INFO L308 CegarLoopForPetriNet]: 763 programPoint places, -58 predicate places. [2023-12-05 21:04:20,051 INFO L500 AbstractCegarLoop]: Abstraction has has 705 places, 736 transitions, 1944 flow [2023-12-05 21:04:20,052 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.6666666666666) internal successors, (2258), 3 states have internal predecessors, (2258), 0 states have call successors, (0), 0 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:20,052 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:20,052 INFO L233 CegarLoopForPetriNet]: trace histogram [19, 19, 19, 19, 18, 18, 1, 1, 1, 1, 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:20,052 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-12-05 21:04:20,052 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:20,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -641695211, now seen corresponding path program 1 times [2023-12-05 21:04:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081691501] [2023-12-05 21:04:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:20,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:20,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:20,177 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:20,177 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:20,177 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:20,177 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:20,178 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-12-05 21:04:20,178 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:20,185 WARN L227 ceAbstractionStarter]: 18 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:20,185 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 19 thread instances. [2023-12-05 21:04:20,327 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:20,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 804 places, 937 transitions, 2292 flow [2023-12-05 21:04:20,742 INFO L124 PetriNetUnfolderBase]: 191/1220 cut-off events. [2023-12-05 21:04:20,742 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2023-12-05 21:04:20,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1220 events. 191/1220 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 4956 event pairs, 0 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1357. Up to 40 conditions per place. [2023-12-05 21:04:20,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 804 places, 937 transitions, 2292 flow [2023-12-05 21:04:20,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 804 places, 937 transitions, 2292 flow [2023-12-05 21:04:20,845 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:20,846 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:20,846 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:20,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:20,847 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:20,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:20,847 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:20,847 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:20,847 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:20,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1275620451, now seen corresponding path program 1 times [2023-12-05 21:04:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476190977] [2023-12-05 21:04:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:20,869 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:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476190977] [2023-12-05 21:04:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476190977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:20,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046475296] [2023-12-05 21:04:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:20,870 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:20,872 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 791 out of 937 [2023-12-05 21:04:20,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 937 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 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:20,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:20,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 791 of 937 [2023-12-05 21:04:20,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:21,309 INFO L124 PetriNetUnfolderBase]: 76/908 cut-off events. [2023-12-05 21:04:21,309 INFO L125 PetriNetUnfolderBase]: For 1311/1311 co-relation queries the response was YES. [2023-12-05 21:04:21,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 908 events. 76/908 cut-off events. For 1311/1311 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3557 event pairs, 0 based on Foata normal form. 2325/3118 useless extension candidates. Maximal degree in co-relation 1117. Up to 60 conditions per place. [2023-12-05 21:04:21,356 INFO L140 encePairwiseOnDemand]: 838/937 looper letters, 25 selfloop transitions, 1 changer transitions 0/777 dead transitions. [2023-12-05 21:04:21,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 777 transitions, 2024 flow [2023-12-05 21:04:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2497 transitions. [2023-12-05 21:04:21,359 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8882959800782639 [2023-12-05 21:04:21,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2497 transitions. [2023-12-05 21:04:21,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2497 transitions. [2023-12-05 21:04:21,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:21,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2497 transitions. [2023-12-05 21:04:21,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 832.3333333333334) internal successors, (2497), 3 states have internal predecessors, (2497), 0 states have call successors, (0), 0 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:21,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:21,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:21,364 INFO L308 CegarLoopForPetriNet]: 804 programPoint places, -62 predicate places. [2023-12-05 21:04:21,364 INFO L500 AbstractCegarLoop]: Abstraction has has 742 places, 777 transitions, 2024 flow [2023-12-05 21:04:21,364 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.0) internal successors, (2379), 3 states have internal predecessors, (2379), 0 states have call successors, (0), 0 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:21,364 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,364 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,364 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-12-05 21:04:21,365 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:21,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1275620452, now seen corresponding path program 1 times [2023-12-05 21:04:21,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396474850] [2023-12-05 21:04:21,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:21,391 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:21,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396474850] [2023-12-05 21:04:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396474850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:21,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949724759] [2023-12-05 21:04:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:21,392 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:21,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:21,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:21,394 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 792 out of 937 [2023-12-05 21:04:21,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 777 transitions, 2024 flow. Second operand has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 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:21,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:21,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 792 of 937 [2023-12-05 21:04:21,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:21,766 INFO L124 PetriNetUnfolderBase]: 76/888 cut-off events. [2023-12-05 21:04:21,766 INFO L125 PetriNetUnfolderBase]: For 1334/1334 co-relation queries the response was YES. [2023-12-05 21:04:21,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 888 events. 76/888 cut-off events. For 1334/1334 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3419 event pairs, 0 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1116. Up to 40 conditions per place. [2023-12-05 21:04:21,819 INFO L140 encePairwiseOnDemand]: 935/937 looper letters, 23 selfloop transitions, 1 changer transitions 0/776 dead transitions. [2023-12-05 21:04:21,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 743 places, 776 transitions, 2068 flow [2023-12-05 21:04:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2401 transitions. [2023-12-05 21:04:21,821 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8541444325862683 [2023-12-05 21:04:21,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2401 transitions. [2023-12-05 21:04:21,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2401 transitions. [2023-12-05 21:04:21,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:21,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2401 transitions. [2023-12-05 21:04:21,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 800.3333333333334) internal successors, (2401), 3 states have internal predecessors, (2401), 0 states have call successors, (0), 0 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:21,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:21,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 937.0) internal successors, (3748), 4 states have internal predecessors, (3748), 0 states have call successors, (0), 0 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:21,827 INFO L308 CegarLoopForPetriNet]: 804 programPoint places, -61 predicate places. [2023-12-05 21:04:21,827 INFO L500 AbstractCegarLoop]: Abstraction has has 743 places, 776 transitions, 2068 flow [2023-12-05 21:04:21,827 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 793.6666666666666) internal successors, (2381), 3 states have internal predecessors, (2381), 0 states have call successors, (0), 0 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:21,827 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,827 INFO L233 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 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:21,827 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-12-05 21:04:21,828 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:21,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1031706634, now seen corresponding path program 1 times [2023-12-05 21:04:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342163124] [2023-12-05 21:04:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:21,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:21,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:21,883 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:21,883 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:21,883 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:21,883 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:21,883 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-12-05 21:04:21,883 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:21,884 WARN L227 ceAbstractionStarter]: 19 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:21,884 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 20 thread instances. [2023-12-05 21:04:21,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:21,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 845 places, 985 transitions, 2430 flow [2023-12-05 21:04:22,482 INFO L124 PetriNetUnfolderBase]: 201/1283 cut-off events. [2023-12-05 21:04:22,482 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2023-12-05 21:04:22,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 1283 events. 201/1283 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5204 event pairs, 0 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 1441. Up to 42 conditions per place. [2023-12-05 21:04:22,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 845 places, 985 transitions, 2430 flow [2023-12-05 21:04:22,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 845 places, 985 transitions, 2430 flow [2023-12-05 21:04:22,596 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:22,596 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:22,596 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:22,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:22,597 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:22,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:22,597 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:22,597 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:22,597 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:22,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash -291168900, now seen corresponding path program 1 times [2023-12-05 21:04:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:22,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850909181] [2023-12-05 21:04:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:22,618 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:22,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850909181] [2023-12-05 21:04:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850909181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:22,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:22,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:22,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120261333] [2023-12-05 21:04:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:22,618 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:22,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:22,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:22,621 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 832 out of 985 [2023-12-05 21:04:22,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 985 transitions, 2430 flow. Second operand has 3 states, 3 states have (on average 834.0) internal successors, (2502), 3 states have internal predecessors, (2502), 0 states have call successors, (0), 0 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:22,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:22,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 832 of 985 [2023-12-05 21:04:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:23,059 INFO L124 PetriNetUnfolderBase]: 80/955 cut-off events. [2023-12-05 21:04:23,059 INFO L125 PetriNetUnfolderBase]: For 1520/1520 co-relation queries the response was YES. [2023-12-05 21:04:23,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 955 events. 80/955 cut-off events. For 1520/1520 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3765 event pairs, 0 based on Foata normal form. 2596/3430 useless extension candidates. Maximal degree in co-relation 1188. Up to 63 conditions per place. [2023-12-05 21:04:23,099 INFO L140 encePairwiseOnDemand]: 881/985 looper letters, 26 selfloop transitions, 1 changer transitions 0/817 dead transitions. [2023-12-05 21:04:23,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 780 places, 817 transitions, 2148 flow [2023-12-05 21:04:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2626 transitions. [2023-12-05 21:04:23,101 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.888663282571912 [2023-12-05 21:04:23,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2626 transitions. [2023-12-05 21:04:23,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2626 transitions. [2023-12-05 21:04:23,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:23,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2626 transitions. [2023-12-05 21:04:23,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 875.3333333333334) internal successors, (2626), 3 states have internal predecessors, (2626), 0 states have call successors, (0), 0 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:23,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:23,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:23,106 INFO L308 CegarLoopForPetriNet]: 845 programPoint places, -65 predicate places. [2023-12-05 21:04:23,106 INFO L500 AbstractCegarLoop]: Abstraction has has 780 places, 817 transitions, 2148 flow [2023-12-05 21:04:23,106 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 834.0) internal successors, (2502), 3 states have internal predecessors, (2502), 0 states have call successors, (0), 0 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:23,106 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:23,106 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:23,107 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-12-05 21:04:23,107 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:23,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash -291168899, now seen corresponding path program 1 times [2023-12-05 21:04:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922202584] [2023-12-05 21:04:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:23,130 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:23,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922202584] [2023-12-05 21:04:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922202584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:23,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581966173] [2023-12-05 21:04:23,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:23,131 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:23,133 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 833 out of 985 [2023-12-05 21:04:23,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 817 transitions, 2148 flow. Second operand has 3 states, 3 states have (on average 834.6666666666666) internal successors, (2504), 3 states have internal predecessors, (2504), 0 states have call successors, (0), 0 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:23,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:23,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 833 of 985 [2023-12-05 21:04:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:23,507 INFO L124 PetriNetUnfolderBase]: 80/934 cut-off events. [2023-12-05 21:04:23,507 INFO L125 PetriNetUnfolderBase]: For 1544/1544 co-relation queries the response was YES. [2023-12-05 21:04:23,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 934 events. 80/934 cut-off events. For 1544/1544 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3609 event pairs, 0 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 1187. Up to 42 conditions per place. [2023-12-05 21:04:23,562 INFO L140 encePairwiseOnDemand]: 983/985 looper letters, 24 selfloop transitions, 1 changer transitions 0/816 dead transitions. [2023-12-05 21:04:23,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 816 transitions, 2194 flow [2023-12-05 21:04:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2525 transitions. [2023-12-05 21:04:23,564 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8544839255499154 [2023-12-05 21:04:23,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2525 transitions. [2023-12-05 21:04:23,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2525 transitions. [2023-12-05 21:04:23,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:23,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2525 transitions. [2023-12-05 21:04:23,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 841.6666666666666) internal successors, (2525), 3 states have internal predecessors, (2525), 0 states have call successors, (0), 0 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:23,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:23,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 985.0) internal successors, (3940), 4 states have internal predecessors, (3940), 0 states have call successors, (0), 0 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:23,569 INFO L308 CegarLoopForPetriNet]: 845 programPoint places, -64 predicate places. [2023-12-05 21:04:23,569 INFO L500 AbstractCegarLoop]: Abstraction has has 781 places, 816 transitions, 2194 flow [2023-12-05 21:04:23,569 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 834.6666666666666) internal successors, (2504), 3 states have internal predecessors, (2504), 0 states have call successors, (0), 0 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:23,569 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:23,570 INFO L233 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 20, 20, 1, 1, 1, 1, 1, 1, 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:23,570 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-12-05 21:04:23,570 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:23,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash -750501614, now seen corresponding path program 1 times [2023-12-05 21:04:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490429462] [2023-12-05 21:04:23,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:23,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:23,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:23,624 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:23,624 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:23,624 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:23,624 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:23,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-12-05 21:04:23,624 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:23,625 WARN L227 ceAbstractionStarter]: 20 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:23,625 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 21 thread instances. [2023-12-05 21:04:23,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:23,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 886 places, 1033 transitions, 2570 flow [2023-12-05 21:04:24,231 INFO L124 PetriNetUnfolderBase]: 211/1346 cut-off events. [2023-12-05 21:04:24,232 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2023-12-05 21:04:24,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 1346 events. 211/1346 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5470 event pairs, 0 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 1526. Up to 44 conditions per place. [2023-12-05 21:04:24,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 886 places, 1033 transitions, 2570 flow [2023-12-05 21:04:24,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 886 places, 1033 transitions, 2570 flow [2023-12-05 21:04:24,356 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:24,357 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:24,357 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:24,358 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:24,359 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:24,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:24,359 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:24,359 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:24,359 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:24,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -89871675, now seen corresponding path program 1 times [2023-12-05 21:04:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720104868] [2023-12-05 21:04:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:24,380 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:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720104868] [2023-12-05 21:04:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720104868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:24,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845085100] [2023-12-05 21:04:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:24,381 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:24,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:24,384 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 873 out of 1033 [2023-12-05 21:04:24,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 1033 transitions, 2570 flow. Second operand has 3 states, 3 states have (on average 875.0) internal successors, (2625), 3 states have internal predecessors, (2625), 0 states have call successors, (0), 0 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:24,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:24,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 873 of 1033 [2023-12-05 21:04:24,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:24,896 INFO L124 PetriNetUnfolderBase]: 84/1002 cut-off events. [2023-12-05 21:04:24,896 INFO L125 PetriNetUnfolderBase]: For 1750/1750 co-relation queries the response was YES. [2023-12-05 21:04:24,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1002 events. 84/1002 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3964 event pairs, 0 based on Foata normal form. 2882/3757 useless extension candidates. Maximal degree in co-relation 1260. Up to 66 conditions per place. [2023-12-05 21:04:24,941 INFO L140 encePairwiseOnDemand]: 924/1033 looper letters, 27 selfloop transitions, 1 changer transitions 0/857 dead transitions. [2023-12-05 21:04:24,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 818 places, 857 transitions, 2274 flow [2023-12-05 21:04:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2755 transitions. [2023-12-05 21:04:24,943 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8889964504678929 [2023-12-05 21:04:24,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2755 transitions. [2023-12-05 21:04:24,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2755 transitions. [2023-12-05 21:04:24,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:24,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2755 transitions. [2023-12-05 21:04:24,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 918.3333333333334) internal successors, (2755), 3 states have internal predecessors, (2755), 0 states have call successors, (0), 0 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:24,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:24,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:24,948 INFO L308 CegarLoopForPetriNet]: 886 programPoint places, -68 predicate places. [2023-12-05 21:04:24,948 INFO L500 AbstractCegarLoop]: Abstraction has has 818 places, 857 transitions, 2274 flow [2023-12-05 21:04:24,948 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 875.0) internal successors, (2625), 3 states have internal predecessors, (2625), 0 states have call successors, (0), 0 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:24,948 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:24,949 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:24,949 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-12-05 21:04:24,949 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:24,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -89871674, now seen corresponding path program 1 times [2023-12-05 21:04:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610111389] [2023-12-05 21:04:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:24,973 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:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610111389] [2023-12-05 21:04:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610111389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488974680] [2023-12-05 21:04:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:24,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:24,976 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 874 out of 1033 [2023-12-05 21:04:24,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 818 places, 857 transitions, 2274 flow. Second operand has 3 states, 3 states have (on average 875.6666666666666) internal successors, (2627), 3 states have internal predecessors, (2627), 0 states have call successors, (0), 0 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:24,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:24,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 874 of 1033 [2023-12-05 21:04:24,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:25,402 INFO L124 PetriNetUnfolderBase]: 84/980 cut-off events. [2023-12-05 21:04:25,402 INFO L125 PetriNetUnfolderBase]: For 1775/1775 co-relation queries the response was YES. [2023-12-05 21:04:25,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 980 events. 84/980 cut-off events. For 1775/1775 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3793 event pairs, 0 based on Foata normal form. 0/875 useless extension candidates. Maximal degree in co-relation 1259. Up to 44 conditions per place. [2023-12-05 21:04:25,460 INFO L140 encePairwiseOnDemand]: 1031/1033 looper letters, 25 selfloop transitions, 1 changer transitions 0/856 dead transitions. [2023-12-05 21:04:25,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 819 places, 856 transitions, 2322 flow [2023-12-05 21:04:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2649 transitions. [2023-12-05 21:04:25,463 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8547918683446273 [2023-12-05 21:04:25,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2649 transitions. [2023-12-05 21:04:25,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2649 transitions. [2023-12-05 21:04:25,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:25,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2649 transitions. [2023-12-05 21:04:25,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 883.0) internal successors, (2649), 3 states have internal predecessors, (2649), 0 states have call successors, (0), 0 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:25,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:25,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1033.0) internal successors, (4132), 4 states have internal predecessors, (4132), 0 states have call successors, (0), 0 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:25,469 INFO L308 CegarLoopForPetriNet]: 886 programPoint places, -67 predicate places. [2023-12-05 21:04:25,469 INFO L500 AbstractCegarLoop]: Abstraction has has 819 places, 856 transitions, 2322 flow [2023-12-05 21:04:25,469 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 875.6666666666666) internal successors, (2627), 3 states have internal predecessors, (2627), 0 states have call successors, (0), 0 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:25,469 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:25,469 INFO L233 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 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:25,469 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-12-05 21:04:25,469 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:25,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1989923031, now seen corresponding path program 1 times [2023-12-05 21:04:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068106338] [2023-12-05 21:04:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:25,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:25,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:25,528 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:25,528 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:25,529 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:25,529 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:25,529 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-12-05 21:04:25,529 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:25,529 WARN L227 ceAbstractionStarter]: 21 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:25,529 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 22 thread instances. [2023-12-05 21:04:25,619 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:25,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 927 places, 1081 transitions, 2712 flow [2023-12-05 21:04:26,179 INFO L124 PetriNetUnfolderBase]: 221/1409 cut-off events. [2023-12-05 21:04:26,180 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2023-12-05 21:04:26,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1409 events. 221/1409 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 5753 event pairs, 0 based on Foata normal form. 0/1119 useless extension candidates. Maximal degree in co-relation 1612. Up to 46 conditions per place. [2023-12-05 21:04:26,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 927 places, 1081 transitions, 2712 flow [2023-12-05 21:04:26,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 927 places, 1081 transitions, 2712 flow [2023-12-05 21:04:26,314 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:26,314 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:26,314 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:26,315 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:26,315 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:26,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:26,315 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:26,315 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:26,315 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:26,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1879512126, now seen corresponding path program 1 times [2023-12-05 21:04:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276627811] [2023-12-05 21:04:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:26,341 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:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276627811] [2023-12-05 21:04:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276627811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149264575] [2023-12-05 21:04:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:26,341 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:26,344 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 914 out of 1081 [2023-12-05 21:04:26,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 927 places, 1081 transitions, 2712 flow. Second operand has 3 states, 3 states have (on average 916.0) internal successors, (2748), 3 states have internal predecessors, (2748), 0 states have call successors, (0), 0 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:26,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:26,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 914 of 1081 [2023-12-05 21:04:26,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:26,877 INFO L124 PetriNetUnfolderBase]: 88/1049 cut-off events. [2023-12-05 21:04:26,877 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2023-12-05 21:04:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 1049 events. 88/1049 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4160 event pairs, 0 based on Foata normal form. 3183/4099 useless extension candidates. Maximal degree in co-relation 1333. Up to 69 conditions per place. [2023-12-05 21:04:26,937 INFO L140 encePairwiseOnDemand]: 967/1081 looper letters, 28 selfloop transitions, 1 changer transitions 0/897 dead transitions. [2023-12-05 21:04:26,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 897 transitions, 2402 flow [2023-12-05 21:04:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2884 transitions. [2023-12-05 21:04:26,939 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.889300030835646 [2023-12-05 21:04:26,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2884 transitions. [2023-12-05 21:04:26,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2884 transitions. [2023-12-05 21:04:26,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:26,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2884 transitions. [2023-12-05 21:04:26,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 961.3333333333334) internal successors, (2884), 3 states have internal predecessors, (2884), 0 states have call successors, (0), 0 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:26,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:26,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:26,945 INFO L308 CegarLoopForPetriNet]: 927 programPoint places, -71 predicate places. [2023-12-05 21:04:26,945 INFO L500 AbstractCegarLoop]: Abstraction has has 856 places, 897 transitions, 2402 flow [2023-12-05 21:04:26,945 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 916.0) internal successors, (2748), 3 states have internal predecessors, (2748), 0 states have call successors, (0), 0 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:26,945 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:26,945 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:26,945 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-12-05 21:04:26,945 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:26,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1879512127, now seen corresponding path program 1 times [2023-12-05 21:04:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:26,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637314551] [2023-12-05 21:04:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:26,972 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:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637314551] [2023-12-05 21:04:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637314551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869436217] [2023-12-05 21:04:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:26,973 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:26,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 915 out of 1081 [2023-12-05 21:04:26,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 897 transitions, 2402 flow. Second operand has 3 states, 3 states have (on average 916.6666666666666) internal successors, (2750), 3 states have internal predecessors, (2750), 0 states have call successors, (0), 0 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:26,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:26,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 915 of 1081 [2023-12-05 21:04:26,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:27,454 INFO L124 PetriNetUnfolderBase]: 88/1026 cut-off events. [2023-12-05 21:04:27,455 INFO L125 PetriNetUnfolderBase]: For 2028/2028 co-relation queries the response was YES. [2023-12-05 21:04:27,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1026 events. 88/1026 cut-off events. For 2028/2028 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 3997 event pairs, 0 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 1332. Up to 46 conditions per place. [2023-12-05 21:04:27,525 INFO L140 encePairwiseOnDemand]: 1079/1081 looper letters, 26 selfloop transitions, 1 changer transitions 0/896 dead transitions. [2023-12-05 21:04:27,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 857 places, 896 transitions, 2452 flow [2023-12-05 21:04:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2773 transitions. [2023-12-05 21:04:27,527 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.855072463768116 [2023-12-05 21:04:27,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2773 transitions. [2023-12-05 21:04:27,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2773 transitions. [2023-12-05 21:04:27,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:27,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2773 transitions. [2023-12-05 21:04:27,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 924.3333333333334) internal successors, (2773), 3 states have internal predecessors, (2773), 0 states have call successors, (0), 0 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:27,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:27,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1081.0) internal successors, (4324), 4 states have internal predecessors, (4324), 0 states have call successors, (0), 0 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:27,532 INFO L308 CegarLoopForPetriNet]: 927 programPoint places, -70 predicate places. [2023-12-05 21:04:27,532 INFO L500 AbstractCegarLoop]: Abstraction has has 857 places, 896 transitions, 2452 flow [2023-12-05 21:04:27,532 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 916.6666666666666) internal successors, (2750), 3 states have internal predecessors, (2750), 0 states have call successors, (0), 0 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:27,532 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:27,533 INFO L233 CegarLoopForPetriNet]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,533 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-12-05 21:04:27,533 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:27,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:27,533 INFO L85 PathProgramCache]: Analyzing trace with hash 540130063, now seen corresponding path program 1 times [2023-12-05 21:04:27,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:27,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462361413] [2023-12-05 21:04:27,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:27,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:27,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:27,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:27,593 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:27,593 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:27,593 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:27,593 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:27,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2023-12-05 21:04:27,593 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:27,594 WARN L227 ceAbstractionStarter]: 22 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:27,594 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 23 thread instances. [2023-12-05 21:04:27,689 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:27,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 968 places, 1129 transitions, 2856 flow [2023-12-05 21:04:28,493 INFO L124 PetriNetUnfolderBase]: 231/1472 cut-off events. [2023-12-05 21:04:28,493 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2023-12-05 21:04:28,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 1472 events. 231/1472 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6033 event pairs, 0 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1699. Up to 48 conditions per place. [2023-12-05 21:04:28,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 968 places, 1129 transitions, 2856 flow [2023-12-05 21:04:28,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 968 places, 1129 transitions, 2856 flow [2023-12-05 21:04:28,575 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:28,575 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:28,575 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:28,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:28,577 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:28,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:28,577 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:28,577 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:28,577 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:28,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1322015207, now seen corresponding path program 1 times [2023-12-05 21:04:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623345853] [2023-12-05 21:04:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:28,600 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:28,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:28,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623345853] [2023-12-05 21:04:28,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623345853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:28,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:28,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192227388] [2023-12-05 21:04:28,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:28,601 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:28,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:28,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:28,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:28,604 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 955 out of 1129 [2023-12-05 21:04:28,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 968 places, 1129 transitions, 2856 flow. Second operand has 3 states, 3 states have (on average 957.0) internal successors, (2871), 3 states have internal predecessors, (2871), 0 states have call successors, (0), 0 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:28,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:28,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 955 of 1129 [2023-12-05 21:04:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:29,237 INFO L124 PetriNetUnfolderBase]: 92/1096 cut-off events. [2023-12-05 21:04:29,237 INFO L125 PetriNetUnfolderBase]: For 2277/2277 co-relation queries the response was YES. [2023-12-05 21:04:29,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1096 events. 92/1096 cut-off events. For 2277/2277 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4358 event pairs, 0 based on Foata normal form. 3499/4456 useless extension candidates. Maximal degree in co-relation 1407. Up to 72 conditions per place. [2023-12-05 21:04:29,318 INFO L140 encePairwiseOnDemand]: 1010/1129 looper letters, 29 selfloop transitions, 1 changer transitions 0/937 dead transitions. [2023-12-05 21:04:29,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 894 places, 937 transitions, 2532 flow [2023-12-05 21:04:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3013 transitions. [2023-12-05 21:04:29,321 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8895777974608798 [2023-12-05 21:04:29,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3013 transitions. [2023-12-05 21:04:29,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3013 transitions. [2023-12-05 21:04:29,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:29,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3013 transitions. [2023-12-05 21:04:29,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 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:29,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:29,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:29,327 INFO L308 CegarLoopForPetriNet]: 968 programPoint places, -74 predicate places. [2023-12-05 21:04:29,327 INFO L500 AbstractCegarLoop]: Abstraction has has 894 places, 937 transitions, 2532 flow [2023-12-05 21:04:29,327 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 957.0) internal successors, (2871), 3 states have internal predecessors, (2871), 0 states have call successors, (0), 0 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:29,327 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:29,327 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:29,327 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2023-12-05 21:04:29,327 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:29,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:29,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1322015208, now seen corresponding path program 1 times [2023-12-05 21:04:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796570461] [2023-12-05 21:04:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:29,384 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:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796570461] [2023-12-05 21:04:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796570461] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895537634] [2023-12-05 21:04:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:29,384 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:29,387 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 956 out of 1129 [2023-12-05 21:04:29,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 894 places, 937 transitions, 2532 flow. Second operand has 3 states, 3 states have (on average 957.6666666666666) internal successors, (2873), 3 states have internal predecessors, (2873), 0 states have call successors, (0), 0 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:29,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:29,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 956 of 1129 [2023-12-05 21:04:29,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:29,961 INFO L124 PetriNetUnfolderBase]: 92/1072 cut-off events. [2023-12-05 21:04:29,961 INFO L125 PetriNetUnfolderBase]: For 2304/2304 co-relation queries the response was YES. [2023-12-05 21:04:30,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 1072 events. 92/1072 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4187 event pairs, 0 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 1406. Up to 48 conditions per place. [2023-12-05 21:04:30,036 INFO L140 encePairwiseOnDemand]: 1127/1129 looper letters, 27 selfloop transitions, 1 changer transitions 0/936 dead transitions. [2023-12-05 21:04:30,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 895 places, 936 transitions, 2584 flow [2023-12-05 21:04:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2897 transitions. [2023-12-05 21:04:30,039 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8553291998819014 [2023-12-05 21:04:30,039 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 2897 transitions. [2023-12-05 21:04:30,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 2897 transitions. [2023-12-05 21:04:30,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:30,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 2897 transitions. [2023-12-05 21:04:30,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 965.6666666666666) internal successors, (2897), 3 states have internal predecessors, (2897), 0 states have call successors, (0), 0 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:30,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:30,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1129.0) internal successors, (4516), 4 states have internal predecessors, (4516), 0 states have call successors, (0), 0 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:30,064 INFO L308 CegarLoopForPetriNet]: 968 programPoint places, -73 predicate places. [2023-12-05 21:04:30,064 INFO L500 AbstractCegarLoop]: Abstraction has has 895 places, 936 transitions, 2584 flow [2023-12-05 21:04:30,065 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 957.6666666666666) internal successors, (2873), 3 states have internal predecessors, (2873), 0 states have call successors, (0), 0 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:30,065 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:30,065 INFO L233 CegarLoopForPetriNet]: trace histogram [24, 24, 24, 24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,065 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2023-12-05 21:04:30,065 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:30,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1483407224, now seen corresponding path program 1 times [2023-12-05 21:04:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239352812] [2023-12-05 21:04:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:30,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:30,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:30,129 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:30,129 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:30,129 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:30,129 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:30,129 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2023-12-05 21:04:30,130 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:30,130 WARN L227 ceAbstractionStarter]: 23 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:30,130 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 24 thread instances. [2023-12-05 21:04:30,220 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:30,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1009 places, 1177 transitions, 3002 flow [2023-12-05 21:04:30,980 INFO L124 PetriNetUnfolderBase]: 241/1535 cut-off events. [2023-12-05 21:04:30,980 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2023-12-05 21:04:31,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 1535 events. 241/1535 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 6291 event pairs, 0 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1787. Up to 50 conditions per place. [2023-12-05 21:04:31,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 1009 places, 1177 transitions, 3002 flow [2023-12-05 21:04:31,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1009 places, 1177 transitions, 3002 flow [2023-12-05 21:04:31,075 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:31,075 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:31,075 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:31,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:31,077 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:31,077 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:31,077 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:31,077 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:31,077 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:31,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1762362432, now seen corresponding path program 1 times [2023-12-05 21:04:31,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:31,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665935438] [2023-12-05 21:04:31,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:31,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:31,099 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:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665935438] [2023-12-05 21:04:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665935438] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:31,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668758012] [2023-12-05 21:04:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:31,100 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:31,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 996 out of 1177 [2023-12-05 21:04:31,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 1177 transitions, 3002 flow. Second operand has 3 states, 3 states have (on average 998.0) internal successors, (2994), 3 states have internal predecessors, (2994), 0 states have call successors, (0), 0 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:31,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:31,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 996 of 1177 [2023-12-05 21:04:31,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:31,702 INFO L124 PetriNetUnfolderBase]: 96/1143 cut-off events. [2023-12-05 21:04:31,702 INFO L125 PetriNetUnfolderBase]: For 2576/2576 co-relation queries the response was YES. [2023-12-05 21:04:31,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1143 events. 96/1143 cut-off events. For 2576/2576 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4552 event pairs, 0 based on Foata normal form. 3830/4828 useless extension candidates. Maximal degree in co-relation 1482. Up to 75 conditions per place. [2023-12-05 21:04:31,789 INFO L140 encePairwiseOnDemand]: 1053/1177 looper letters, 30 selfloop transitions, 1 changer transitions 0/977 dead transitions. [2023-12-05 21:04:31,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 977 transitions, 2664 flow [2023-12-05 21:04:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:31,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3142 transitions. [2023-12-05 21:04:31,792 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8898329085244973 [2023-12-05 21:04:31,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3142 transitions. [2023-12-05 21:04:31,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3142 transitions. [2023-12-05 21:04:31,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:31,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3142 transitions. [2023-12-05 21:04:31,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1047.3333333333333) internal successors, (3142), 3 states have internal predecessors, (3142), 0 states have call successors, (0), 0 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:31,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:31,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:31,797 INFO L308 CegarLoopForPetriNet]: 1009 programPoint places, -77 predicate places. [2023-12-05 21:04:31,797 INFO L500 AbstractCegarLoop]: Abstraction has has 932 places, 977 transitions, 2664 flow [2023-12-05 21:04:31,797 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 998.0) internal successors, (2994), 3 states have internal predecessors, (2994), 0 states have call successors, (0), 0 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:31,797 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:31,797 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:31,797 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2023-12-05 21:04:31,797 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:31,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1762362431, now seen corresponding path program 1 times [2023-12-05 21:04:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339547373] [2023-12-05 21:04:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:31,826 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:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339547373] [2023-12-05 21:04:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339547373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:31,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547744190] [2023-12-05 21:04:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:31,827 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:31,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:31,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:31,829 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 997 out of 1177 [2023-12-05 21:04:31,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 977 transitions, 2664 flow. Second operand has 3 states, 3 states have (on average 998.6666666666666) internal successors, (2996), 3 states have internal predecessors, (2996), 0 states have call successors, (0), 0 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:31,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:31,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 997 of 1177 [2023-12-05 21:04:31,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:32,397 INFO L124 PetriNetUnfolderBase]: 96/1118 cut-off events. [2023-12-05 21:04:32,398 INFO L125 PetriNetUnfolderBase]: For 2604/2604 co-relation queries the response was YES. [2023-12-05 21:04:32,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1118 events. 96/1118 cut-off events. For 2604/2604 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4377 event pairs, 0 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 1481. Up to 50 conditions per place. [2023-12-05 21:04:32,482 INFO L140 encePairwiseOnDemand]: 1175/1177 looper letters, 28 selfloop transitions, 1 changer transitions 0/976 dead transitions. [2023-12-05 21:04:32,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 976 transitions, 2718 flow [2023-12-05 21:04:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2023-12-05 21:04:32,484 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8555649957519117 [2023-12-05 21:04:32,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3021 transitions. [2023-12-05 21:04:32,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3021 transitions. [2023-12-05 21:04:32,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:32,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3021 transitions. [2023-12-05 21:04:32,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1007.0) internal successors, (3021), 3 states have internal predecessors, (3021), 0 states have call successors, (0), 0 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:32,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:32,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1177.0) internal successors, (4708), 4 states have internal predecessors, (4708), 0 states have call successors, (0), 0 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:32,490 INFO L308 CegarLoopForPetriNet]: 1009 programPoint places, -76 predicate places. [2023-12-05 21:04:32,490 INFO L500 AbstractCegarLoop]: Abstraction has has 933 places, 976 transitions, 2718 flow [2023-12-05 21:04:32,490 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 998.6666666666666) internal successors, (2996), 3 states have internal predecessors, (2996), 0 states have call successors, (0), 0 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:32,490 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:32,490 INFO L233 CegarLoopForPetriNet]: trace histogram [25, 25, 25, 25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,490 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2023-12-05 21:04:32,490 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:32,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:32,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1598326796, now seen corresponding path program 1 times [2023-12-05 21:04:32,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355776157] [2023-12-05 21:04:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:32,522 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:32,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:32,556 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:32,556 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:32,556 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:32,556 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:32,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2023-12-05 21:04:32,556 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:32,557 WARN L227 ceAbstractionStarter]: 24 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:32,557 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 25 thread instances. [2023-12-05 21:04:32,651 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:32,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1050 places, 1225 transitions, 3150 flow [2023-12-05 21:04:33,506 INFO L124 PetriNetUnfolderBase]: 251/1598 cut-off events. [2023-12-05 21:04:33,506 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2023-12-05 21:04:33,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 1598 events. 251/1598 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6553 event pairs, 0 based on Foata normal form. 0/1269 useless extension candidates. Maximal degree in co-relation 1876. Up to 52 conditions per place. [2023-12-05 21:04:33,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 1050 places, 1225 transitions, 3150 flow [2023-12-05 21:04:33,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1050 places, 1225 transitions, 3150 flow [2023-12-05 21:04:33,636 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:33,636 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:33,636 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:33,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:33,638 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:33,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:33,638 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:33,638 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:33,638 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:33,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:33,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1216313801, now seen corresponding path program 1 times [2023-12-05 21:04:33,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:33,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254945042] [2023-12-05 21:04:33,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:33,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:33,659 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:33,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:33,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254945042] [2023-12-05 21:04:33,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254945042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:33,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:33,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:33,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68316061] [2023-12-05 21:04:33,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:33,660 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:33,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:33,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:33,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:33,662 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1037 out of 1225 [2023-12-05 21:04:33,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 1225 transitions, 3150 flow. Second operand has 3 states, 3 states have (on average 1039.0) internal successors, (3117), 3 states have internal predecessors, (3117), 0 states have call successors, (0), 0 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:33,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:33,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1037 of 1225 [2023-12-05 21:04:33,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:34,295 INFO L124 PetriNetUnfolderBase]: 100/1190 cut-off events. [2023-12-05 21:04:34,295 INFO L125 PetriNetUnfolderBase]: For 2900/2900 co-relation queries the response was YES. [2023-12-05 21:04:34,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 1190 events. 100/1190 cut-off events. For 2900/2900 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4750 event pairs, 0 based on Foata normal form. 4176/5215 useless extension candidates. Maximal degree in co-relation 1558. Up to 78 conditions per place. [2023-12-05 21:04:34,392 INFO L140 encePairwiseOnDemand]: 1096/1225 looper letters, 31 selfloop transitions, 1 changer transitions 0/1017 dead transitions. [2023-12-05 21:04:34,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 970 places, 1017 transitions, 2798 flow [2023-12-05 21:04:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3271 transitions. [2023-12-05 21:04:34,394 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8900680272108844 [2023-12-05 21:04:34,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3271 transitions. [2023-12-05 21:04:34,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3271 transitions. [2023-12-05 21:04:34,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:34,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3271 transitions. [2023-12-05 21:04:34,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1090.3333333333333) internal successors, (3271), 3 states have internal predecessors, (3271), 0 states have call successors, (0), 0 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:34,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:34,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:34,399 INFO L308 CegarLoopForPetriNet]: 1050 programPoint places, -80 predicate places. [2023-12-05 21:04:34,399 INFO L500 AbstractCegarLoop]: Abstraction has has 970 places, 1017 transitions, 2798 flow [2023-12-05 21:04:34,400 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1039.0) internal successors, (3117), 3 states have internal predecessors, (3117), 0 states have call successors, (0), 0 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:34,400 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:34,400 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:34,400 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2023-12-05 21:04:34,400 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:34,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1216313802, now seen corresponding path program 1 times [2023-12-05 21:04:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801438988] [2023-12-05 21:04:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:34,427 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:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801438988] [2023-12-05 21:04:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801438988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:34,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:34,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:34,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496118490] [2023-12-05 21:04:34,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:34,428 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:34,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:34,430 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1038 out of 1225 [2023-12-05 21:04:34,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 970 places, 1017 transitions, 2798 flow. Second operand has 3 states, 3 states have (on average 1039.6666666666667) internal successors, (3119), 3 states have internal predecessors, (3119), 0 states have call successors, (0), 0 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:34,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:34,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1038 of 1225 [2023-12-05 21:04:34,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:35,040 INFO L124 PetriNetUnfolderBase]: 100/1164 cut-off events. [2023-12-05 21:04:35,041 INFO L125 PetriNetUnfolderBase]: For 2929/2929 co-relation queries the response was YES. [2023-12-05 21:04:35,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 1164 events. 100/1164 cut-off events. For 2929/2929 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4559 event pairs, 0 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1557. Up to 52 conditions per place. [2023-12-05 21:04:35,135 INFO L140 encePairwiseOnDemand]: 1223/1225 looper letters, 29 selfloop transitions, 1 changer transitions 0/1016 dead transitions. [2023-12-05 21:04:35,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 971 places, 1016 transitions, 2854 flow [2023-12-05 21:04:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3145 transitions. [2023-12-05 21:04:35,137 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.85578231292517 [2023-12-05 21:04:35,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3145 transitions. [2023-12-05 21:04:35,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3145 transitions. [2023-12-05 21:04:35,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:35,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3145 transitions. [2023-12-05 21:04:35,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1048.3333333333333) internal successors, (3145), 3 states have internal predecessors, (3145), 0 states have call successors, (0), 0 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:35,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:35,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1225.0) internal successors, (4900), 4 states have internal predecessors, (4900), 0 states have call successors, (0), 0 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:35,144 INFO L308 CegarLoopForPetriNet]: 1050 programPoint places, -79 predicate places. [2023-12-05 21:04:35,144 INFO L500 AbstractCegarLoop]: Abstraction has has 971 places, 1016 transitions, 2854 flow [2023-12-05 21:04:35,145 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1039.6666666666667) internal successors, (3119), 3 states have internal predecessors, (3119), 0 states have call successors, (0), 0 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:35,145 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:35,145 INFO L233 CegarLoopForPetriNet]: trace histogram [26, 26, 26, 26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,145 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2023-12-05 21:04:35,145 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:35,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1785373735, now seen corresponding path program 1 times [2023-12-05 21:04:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887265638] [2023-12-05 21:04:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:35,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:35,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:35,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:35,219 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:35,219 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:35,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:35,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:35,220 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2023-12-05 21:04:35,220 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:35,220 WARN L227 ceAbstractionStarter]: 25 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:35,220 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 26 thread instances. [2023-12-05 21:04:35,317 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:35,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1091 places, 1273 transitions, 3300 flow [2023-12-05 21:04:36,110 INFO L124 PetriNetUnfolderBase]: 261/1661 cut-off events. [2023-12-05 21:04:36,110 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2023-12-05 21:04:36,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 1661 events. 261/1661 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 6832 event pairs, 0 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 1966. Up to 54 conditions per place. [2023-12-05 21:04:36,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 1091 places, 1273 transitions, 3300 flow [2023-12-05 21:04:36,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1091 places, 1273 transitions, 3300 flow [2023-12-05 21:04:36,298 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:36,298 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:36,298 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:36,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:36,300 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:36,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:36,300 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:36,300 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:36,300 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:36,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1668109314, now seen corresponding path program 1 times [2023-12-05 21:04:36,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:36,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20254435] [2023-12-05 21:04:36,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:36,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:36,324 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:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20254435] [2023-12-05 21:04:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20254435] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:36,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262344143] [2023-12-05 21:04:36,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:36,325 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:36,327 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1273 [2023-12-05 21:04:36,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1091 places, 1273 transitions, 3300 flow. Second operand has 3 states, 3 states have (on average 1080.0) internal successors, (3240), 3 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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:36,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:36,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1273 [2023-12-05 21:04:36,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:36,996 INFO L124 PetriNetUnfolderBase]: 104/1237 cut-off events. [2023-12-05 21:04:36,996 INFO L125 PetriNetUnfolderBase]: For 3250/3250 co-relation queries the response was YES. [2023-12-05 21:04:37,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 1237 events. 104/1237 cut-off events. For 3250/3250 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4950 event pairs, 0 based on Foata normal form. 4537/5617 useless extension candidates. Maximal degree in co-relation 1635. Up to 81 conditions per place. [2023-12-05 21:04:37,096 INFO L140 encePairwiseOnDemand]: 1139/1273 looper letters, 32 selfloop transitions, 1 changer transitions 0/1057 dead transitions. [2023-12-05 21:04:37,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1008 places, 1057 transitions, 2934 flow [2023-12-05 21:04:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3400 transitions. [2023-12-05 21:04:37,099 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8902854150301126 [2023-12-05 21:04:37,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3400 transitions. [2023-12-05 21:04:37,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3400 transitions. [2023-12-05 21:04:37,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:37,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3400 transitions. [2023-12-05 21:04:37,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1133.3333333333333) internal successors, (3400), 3 states have internal predecessors, (3400), 0 states have call successors, (0), 0 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:37,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:37,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:37,104 INFO L308 CegarLoopForPetriNet]: 1091 programPoint places, -83 predicate places. [2023-12-05 21:04:37,104 INFO L500 AbstractCegarLoop]: Abstraction has has 1008 places, 1057 transitions, 2934 flow [2023-12-05 21:04:37,104 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.0) internal successors, (3240), 3 states have internal predecessors, (3240), 0 states have call successors, (0), 0 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:37,105 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:37,105 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:37,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2023-12-05 21:04:37,105 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:37,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1668109315, now seen corresponding path program 1 times [2023-12-05 21:04:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383894612] [2023-12-05 21:04:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:37,132 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:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383894612] [2023-12-05 21:04:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383894612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:37,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231702463] [2023-12-05 21:04:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:37,133 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:37,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:37,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:37,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:37,135 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1079 out of 1273 [2023-12-05 21:04:37,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1008 places, 1057 transitions, 2934 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 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:37,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:37,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1079 of 1273 [2023-12-05 21:04:37,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:37,893 INFO L124 PetriNetUnfolderBase]: 104/1210 cut-off events. [2023-12-05 21:04:37,894 INFO L125 PetriNetUnfolderBase]: For 3280/3280 co-relation queries the response was YES. [2023-12-05 21:04:37,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 1210 events. 104/1210 cut-off events. For 3280/3280 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4743 event pairs, 0 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1634. Up to 54 conditions per place. [2023-12-05 21:04:37,955 INFO L140 encePairwiseOnDemand]: 1271/1273 looper letters, 30 selfloop transitions, 1 changer transitions 0/1056 dead transitions. [2023-12-05 21:04:37,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 1056 transitions, 2992 flow [2023-12-05 21:04:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3269 transitions. [2023-12-05 21:04:37,959 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8559832416863054 [2023-12-05 21:04:37,959 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3269 transitions. [2023-12-05 21:04:37,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3269 transitions. [2023-12-05 21:04:37,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:37,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3269 transitions. [2023-12-05 21:04:37,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1089.6666666666667) internal successors, (3269), 3 states have internal predecessors, (3269), 0 states have call successors, (0), 0 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:37,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:37,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1273.0) internal successors, (5092), 4 states have internal predecessors, (5092), 0 states have call successors, (0), 0 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:37,963 INFO L308 CegarLoopForPetriNet]: 1091 programPoint places, -82 predicate places. [2023-12-05 21:04:37,964 INFO L500 AbstractCegarLoop]: Abstraction has has 1009 places, 1056 transitions, 2992 flow [2023-12-05 21:04:37,964 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 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:37,964 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:37,964 INFO L233 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,964 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2023-12-05 21:04:37,964 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:37,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1238089719, now seen corresponding path program 1 times [2023-12-05 21:04:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:37,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64787371] [2023-12-05 21:04:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:37,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:38,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:38,037 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:38,037 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:38,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:38,037 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:38,037 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2023-12-05 21:04:38,037 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:38,037 WARN L227 ceAbstractionStarter]: 26 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:38,037 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 27 thread instances. [2023-12-05 21:04:38,133 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:38,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1132 places, 1321 transitions, 3452 flow [2023-12-05 21:04:38,966 INFO L124 PetriNetUnfolderBase]: 271/1724 cut-off events. [2023-12-05 21:04:38,966 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-12-05 21:04:39,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1724 events. 271/1724 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7126 event pairs, 0 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 2057. Up to 56 conditions per place. [2023-12-05 21:04:39,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 1132 places, 1321 transitions, 3452 flow [2023-12-05 21:04:39,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1132 places, 1321 transitions, 3452 flow [2023-12-05 21:04:39,180 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:39,180 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:39,181 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:39,182 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:39,182 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:39,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:39,182 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:39,182 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:39,182 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:39,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:39,182 INFO L85 PathProgramCache]: Analyzing trace with hash -406975893, now seen corresponding path program 1 times [2023-12-05 21:04:39,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:39,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306443496] [2023-12-05 21:04:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:39,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:39,207 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:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:39,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306443496] [2023-12-05 21:04:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306443496] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:39,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531854855] [2023-12-05 21:04:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:39,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:39,210 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1119 out of 1321 [2023-12-05 21:04:39,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1132 places, 1321 transitions, 3452 flow. Second operand has 3 states, 3 states have (on average 1121.0) internal successors, (3363), 3 states have internal predecessors, (3363), 0 states have call successors, (0), 0 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:39,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:39,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1119 of 1321 [2023-12-05 21:04:39,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:40,076 INFO L124 PetriNetUnfolderBase]: 108/1284 cut-off events. [2023-12-05 21:04:40,076 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-12-05 21:04:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1806 conditions, 1284 events. 108/1284 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5148 event pairs, 0 based on Foata normal form. 4913/6034 useless extension candidates. Maximal degree in co-relation 1713. Up to 84 conditions per place. [2023-12-05 21:04:40,148 INFO L140 encePairwiseOnDemand]: 1182/1321 looper letters, 33 selfloop transitions, 1 changer transitions 0/1097 dead transitions. [2023-12-05 21:04:40,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 1097 transitions, 3072 flow [2023-12-05 21:04:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3529 transitions. [2023-12-05 21:04:40,151 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8904870047943477 [2023-12-05 21:04:40,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3529 transitions. [2023-12-05 21:04:40,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3529 transitions. [2023-12-05 21:04:40,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:40,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3529 transitions. [2023-12-05 21:04:40,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1176.3333333333333) internal successors, (3529), 3 states have internal predecessors, (3529), 0 states have call successors, (0), 0 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:40,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:40,156 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:40,157 INFO L308 CegarLoopForPetriNet]: 1132 programPoint places, -86 predicate places. [2023-12-05 21:04:40,157 INFO L500 AbstractCegarLoop]: Abstraction has has 1046 places, 1097 transitions, 3072 flow [2023-12-05 21:04:40,157 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1121.0) internal successors, (3363), 3 states have internal predecessors, (3363), 0 states have call successors, (0), 0 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:40,157 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:40,158 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:40,158 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2023-12-05 21:04:40,158 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:40,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash -406975892, now seen corresponding path program 1 times [2023-12-05 21:04:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733745654] [2023-12-05 21:04:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:40,190 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:40,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733745654] [2023-12-05 21:04:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733745654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:40,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:40,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:40,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638938392] [2023-12-05 21:04:40,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:40,191 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:40,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:40,194 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1120 out of 1321 [2023-12-05 21:04:40,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1097 transitions, 3072 flow. Second operand has 3 states, 3 states have (on average 1121.6666666666667) internal successors, (3365), 3 states have internal predecessors, (3365), 0 states have call successors, (0), 0 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:40,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:40,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1120 of 1321 [2023-12-05 21:04:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:40,974 INFO L124 PetriNetUnfolderBase]: 108/1256 cut-off events. [2023-12-05 21:04:40,974 INFO L125 PetriNetUnfolderBase]: For 3658/3658 co-relation queries the response was YES. [2023-12-05 21:04:41,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 1256 events. 108/1256 cut-off events. For 3658/3658 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4945 event pairs, 0 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 1712. Up to 56 conditions per place. [2023-12-05 21:04:41,081 INFO L140 encePairwiseOnDemand]: 1319/1321 looper letters, 31 selfloop transitions, 1 changer transitions 0/1096 dead transitions. [2023-12-05 21:04:41,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1047 places, 1096 transitions, 3132 flow [2023-12-05 21:04:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3393 transitions. [2023-12-05 21:04:41,084 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8561695685087055 [2023-12-05 21:04:41,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3393 transitions. [2023-12-05 21:04:41,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3393 transitions. [2023-12-05 21:04:41,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:41,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3393 transitions. [2023-12-05 21:04:41,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1131.0) internal successors, (3393), 3 states have internal predecessors, (3393), 0 states have call successors, (0), 0 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:41,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:41,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1321.0) internal successors, (5284), 4 states have internal predecessors, (5284), 0 states have call successors, (0), 0 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:41,088 INFO L308 CegarLoopForPetriNet]: 1132 programPoint places, -85 predicate places. [2023-12-05 21:04:41,088 INFO L500 AbstractCegarLoop]: Abstraction has has 1047 places, 1096 transitions, 3132 flow [2023-12-05 21:04:41,089 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1121.6666666666667) internal successors, (3365), 3 states have internal predecessors, (3365), 0 states have call successors, (0), 0 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:41,089 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:41,089 INFO L233 CegarLoopForPetriNet]: trace histogram [28, 28, 28, 28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2023-12-05 21:04:41,089 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:41,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1455075846, now seen corresponding path program 1 times [2023-12-05 21:04:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486375975] [2023-12-05 21:04:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:41,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:41,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:41,168 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:41,168 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:41,168 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:41,168 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:41,168 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2023-12-05 21:04:41,168 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:41,169 WARN L227 ceAbstractionStarter]: 27 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:41,169 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 28 thread instances. [2023-12-05 21:04:41,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:41,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1173 places, 1369 transitions, 3606 flow [2023-12-05 21:04:42,165 INFO L124 PetriNetUnfolderBase]: 281/1787 cut-off events. [2023-12-05 21:04:42,165 INFO L125 PetriNetUnfolderBase]: For 4032/4032 co-relation queries the response was YES. [2023-12-05 21:04:42,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2250 conditions, 1787 events. 281/1787 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7380 event pairs, 0 based on Foata normal form. 0/1419 useless extension candidates. Maximal degree in co-relation 2149. Up to 58 conditions per place. [2023-12-05 21:04:42,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 1173 places, 1369 transitions, 3606 flow [2023-12-05 21:04:42,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1173 places, 1369 transitions, 3606 flow [2023-12-05 21:04:42,385 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:42,386 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:42,386 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:42,387 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:42,387 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:42,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:42,387 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:42,387 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:42,387 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:42,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -713974524, now seen corresponding path program 1 times [2023-12-05 21:04:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628200272] [2023-12-05 21:04:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:42,414 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:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628200272] [2023-12-05 21:04:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628200272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:42,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966299989] [2023-12-05 21:04:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:42,414 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:42,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:42,418 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1160 out of 1369 [2023-12-05 21:04:42,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1173 places, 1369 transitions, 3606 flow. Second operand has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 0 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:42,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:42,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1160 of 1369 [2023-12-05 21:04:42,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:43,215 INFO L124 PetriNetUnfolderBase]: 112/1331 cut-off events. [2023-12-05 21:04:43,215 INFO L125 PetriNetUnfolderBase]: For 4032/4032 co-relation queries the response was YES. [2023-12-05 21:04:43,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1331 events. 112/1331 cut-off events. For 4032/4032 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5348 event pairs, 0 based on Foata normal form. 5304/6466 useless extension candidates. Maximal degree in co-relation 1792. Up to 87 conditions per place. [2023-12-05 21:04:43,312 INFO L140 encePairwiseOnDemand]: 1225/1369 looper letters, 34 selfloop transitions, 1 changer transitions 0/1137 dead transitions. [2023-12-05 21:04:43,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1084 places, 1137 transitions, 3212 flow [2023-12-05 21:04:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3658 transitions. [2023-12-05 21:04:43,315 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8906744582420258 [2023-12-05 21:04:43,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3658 transitions. [2023-12-05 21:04:43,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3658 transitions. [2023-12-05 21:04:43,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:43,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3658 transitions. [2023-12-05 21:04:43,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1219.3333333333333) internal successors, (3658), 3 states have internal predecessors, (3658), 0 states have call successors, (0), 0 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:43,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:43,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:43,320 INFO L308 CegarLoopForPetriNet]: 1173 programPoint places, -89 predicate places. [2023-12-05 21:04:43,320 INFO L500 AbstractCegarLoop]: Abstraction has has 1084 places, 1137 transitions, 3212 flow [2023-12-05 21:04:43,321 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.0) internal successors, (3486), 3 states have internal predecessors, (3486), 0 states have call successors, (0), 0 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:43,321 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:43,321 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:43,321 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2023-12-05 21:04:43,321 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:43,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -713974523, now seen corresponding path program 1 times [2023-12-05 21:04:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:43,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497399880] [2023-12-05 21:04:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:43,350 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:43,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497399880] [2023-12-05 21:04:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497399880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:43,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062595024] [2023-12-05 21:04:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:43,351 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:43,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:43,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:43,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:43,353 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1161 out of 1369 [2023-12-05 21:04:43,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1084 places, 1137 transitions, 3212 flow. Second operand has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 0 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:43,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:43,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1161 of 1369 [2023-12-05 21:04:43,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:44,109 INFO L124 PetriNetUnfolderBase]: 112/1302 cut-off events. [2023-12-05 21:04:44,109 INFO L125 PetriNetUnfolderBase]: For 4064/4064 co-relation queries the response was YES. [2023-12-05 21:04:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1302 events. 112/1302 cut-off events. For 4064/4064 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5132 event pairs, 0 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 1791. Up to 58 conditions per place. [2023-12-05 21:04:44,222 INFO L140 encePairwiseOnDemand]: 1367/1369 looper letters, 32 selfloop transitions, 1 changer transitions 0/1136 dead transitions. [2023-12-05 21:04:44,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1085 places, 1136 transitions, 3274 flow [2023-12-05 21:04:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3517 transitions. [2023-12-05 21:04:44,224 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8563428293158023 [2023-12-05 21:04:44,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3517 transitions. [2023-12-05 21:04:44,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3517 transitions. [2023-12-05 21:04:44,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:44,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3517 transitions. [2023-12-05 21:04:44,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1172.3333333333333) internal successors, (3517), 3 states have internal predecessors, (3517), 0 states have call successors, (0), 0 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:44,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:44,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1369.0) internal successors, (5476), 4 states have internal predecessors, (5476), 0 states have call successors, (0), 0 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:44,230 INFO L308 CegarLoopForPetriNet]: 1173 programPoint places, -88 predicate places. [2023-12-05 21:04:44,230 INFO L500 AbstractCegarLoop]: Abstraction has has 1085 places, 1136 transitions, 3274 flow [2023-12-05 21:04:44,230 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1162.6666666666667) internal successors, (3488), 3 states have internal predecessors, (3488), 0 states have call successors, (0), 0 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:44,230 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:44,230 INFO L233 CegarLoopForPetriNet]: trace histogram [29, 29, 29, 29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,230 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2023-12-05 21:04:44,230 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:44,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2135655674, now seen corresponding path program 1 times [2023-12-05 21:04:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:44,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444220704] [2023-12-05 21:04:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:44,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:44,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:44,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:44,306 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:44,307 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:44,307 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:44,307 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:44,307 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2023-12-05 21:04:44,307 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:44,307 WARN L227 ceAbstractionStarter]: 28 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:44,307 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 29 thread instances. [2023-12-05 21:04:44,409 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:44,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1214 places, 1417 transitions, 3762 flow [2023-12-05 21:04:45,475 INFO L124 PetriNetUnfolderBase]: 291/1850 cut-off events. [2023-12-05 21:04:45,475 INFO L125 PetriNetUnfolderBase]: For 4466/4466 co-relation queries the response was YES. [2023-12-05 21:04:45,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1850 events. 291/1850 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7631 event pairs, 0 based on Foata normal form. 0/1469 useless extension candidates. Maximal degree in co-relation 2242. Up to 60 conditions per place. [2023-12-05 21:04:45,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 1214 places, 1417 transitions, 3762 flow [2023-12-05 21:04:45,592 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1214 places, 1417 transitions, 3762 flow [2023-12-05 21:04:45,593 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:45,593 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:45,593 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:45,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:45,594 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:45,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:45,594 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:45,594 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:45,594 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:45,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 747113421, now seen corresponding path program 1 times [2023-12-05 21:04:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685973448] [2023-12-05 21:04:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:45,618 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:45,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685973448] [2023-12-05 21:04:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685973448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:45,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086320997] [2023-12-05 21:04:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:45,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:45,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:45,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:45,621 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1201 out of 1417 [2023-12-05 21:04:45,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1214 places, 1417 transitions, 3762 flow. Second operand has 3 states, 3 states have (on average 1203.0) internal successors, (3609), 3 states have internal predecessors, (3609), 0 states have call successors, (0), 0 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:45,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:45,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1201 of 1417 [2023-12-05 21:04:45,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:46,505 INFO L124 PetriNetUnfolderBase]: 116/1378 cut-off events. [2023-12-05 21:04:46,506 INFO L125 PetriNetUnfolderBase]: For 4466/4466 co-relation queries the response was YES. [2023-12-05 21:04:46,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1378 events. 116/1378 cut-off events. For 4466/4466 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5529 event pairs, 0 based on Foata normal form. 5710/6913 useless extension candidates. Maximal degree in co-relation 1872. Up to 90 conditions per place. [2023-12-05 21:04:46,642 INFO L140 encePairwiseOnDemand]: 1268/1417 looper letters, 35 selfloop transitions, 1 changer transitions 0/1177 dead transitions. [2023-12-05 21:04:46,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1122 places, 1177 transitions, 3354 flow [2023-12-05 21:04:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3787 transitions. [2023-12-05 21:04:46,645 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8908492119501293 [2023-12-05 21:04:46,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3787 transitions. [2023-12-05 21:04:46,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3787 transitions. [2023-12-05 21:04:46,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:46,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3787 transitions. [2023-12-05 21:04:46,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1262.3333333333333) internal successors, (3787), 3 states have internal predecessors, (3787), 0 states have call successors, (0), 0 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:46,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:46,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:46,651 INFO L308 CegarLoopForPetriNet]: 1214 programPoint places, -92 predicate places. [2023-12-05 21:04:46,651 INFO L500 AbstractCegarLoop]: Abstraction has has 1122 places, 1177 transitions, 3354 flow [2023-12-05 21:04:46,651 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1203.0) internal successors, (3609), 3 states have internal predecessors, (3609), 0 states have call successors, (0), 0 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:46,651 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:46,651 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:46,651 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2023-12-05 21:04:46,651 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:46,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash 747113422, now seen corresponding path program 1 times [2023-12-05 21:04:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952362644] [2023-12-05 21:04:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:46,683 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:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952362644] [2023-12-05 21:04:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952362644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020485943] [2023-12-05 21:04:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:46,684 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:46,687 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1202 out of 1417 [2023-12-05 21:04:46,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1122 places, 1177 transitions, 3354 flow. Second operand has 3 states, 3 states have (on average 1203.6666666666667) internal successors, (3611), 3 states have internal predecessors, (3611), 0 states have call successors, (0), 0 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:46,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:46,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1202 of 1417 [2023-12-05 21:04:46,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:47,575 INFO L124 PetriNetUnfolderBase]: 116/1348 cut-off events. [2023-12-05 21:04:47,575 INFO L125 PetriNetUnfolderBase]: For 4499/4499 co-relation queries the response was YES. [2023-12-05 21:04:47,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 1348 events. 116/1348 cut-off events. For 4499/4499 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5310 event pairs, 0 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 1871. Up to 60 conditions per place. [2023-12-05 21:04:47,684 INFO L140 encePairwiseOnDemand]: 1415/1417 looper letters, 33 selfloop transitions, 1 changer transitions 0/1176 dead transitions. [2023-12-05 21:04:47,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1123 places, 1176 transitions, 3418 flow [2023-12-05 21:04:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3641 transitions. [2023-12-05 21:04:47,686 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.856504351917196 [2023-12-05 21:04:47,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3641 transitions. [2023-12-05 21:04:47,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3641 transitions. [2023-12-05 21:04:47,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:47,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3641 transitions. [2023-12-05 21:04:47,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1213.6666666666667) internal successors, (3641), 3 states have internal predecessors, (3641), 0 states have call successors, (0), 0 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:47,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:47,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1417.0) internal successors, (5668), 4 states have internal predecessors, (5668), 0 states have call successors, (0), 0 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:47,692 INFO L308 CegarLoopForPetriNet]: 1214 programPoint places, -91 predicate places. [2023-12-05 21:04:47,692 INFO L500 AbstractCegarLoop]: Abstraction has has 1123 places, 1176 transitions, 3418 flow [2023-12-05 21:04:47,692 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1203.6666666666667) internal successors, (3611), 3 states have internal predecessors, (3611), 0 states have call successors, (0), 0 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:47,692 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:47,692 INFO L233 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2023-12-05 21:04:47,693 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:47,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:47,693 INFO L85 PathProgramCache]: Analyzing trace with hash -47628837, now seen corresponding path program 1 times [2023-12-05 21:04:47,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:47,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277208389] [2023-12-05 21:04:47,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:47,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:47,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:47,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:47,774 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:47,774 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:47,774 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:47,775 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:47,775 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2023-12-05 21:04:47,775 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:47,775 WARN L227 ceAbstractionStarter]: 29 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:47,775 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 30 thread instances. [2023-12-05 21:04:47,888 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1255 places, 1465 transitions, 3920 flow [2023-12-05 21:04:48,954 INFO L124 PetriNetUnfolderBase]: 301/1913 cut-off events. [2023-12-05 21:04:48,955 INFO L125 PetriNetUnfolderBase]: For 4930/4930 co-relation queries the response was YES. [2023-12-05 21:04:49,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1913 events. 301/1913 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 7897 event pairs, 0 based on Foata normal form. 0/1519 useless extension candidates. Maximal degree in co-relation 2336. Up to 62 conditions per place. [2023-12-05 21:04:49,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 1255 places, 1465 transitions, 3920 flow [2023-12-05 21:04:49,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1255 places, 1465 transitions, 3920 flow [2023-12-05 21:04:49,221 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:49,222 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:49,223 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:49,224 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:49,224 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:49,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:49,224 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:49,224 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:49,224 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:49,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -318679354, now seen corresponding path program 1 times [2023-12-05 21:04:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281453407] [2023-12-05 21:04:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:49,249 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,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281453407] [2023-12-05 21:04:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281453407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:49,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647257925] [2023-12-05 21:04:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:49,250 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:49,253 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1242 out of 1465 [2023-12-05 21:04:49,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1255 places, 1465 transitions, 3920 flow. Second operand has 3 states, 3 states have (on average 1244.0) internal successors, (3732), 3 states have internal predecessors, (3732), 0 states have call successors, (0), 0 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,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:49,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1242 of 1465 [2023-12-05 21:04:49,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:50,252 INFO L124 PetriNetUnfolderBase]: 120/1425 cut-off events. [2023-12-05 21:04:50,253 INFO L125 PetriNetUnfolderBase]: For 4930/4930 co-relation queries the response was YES. [2023-12-05 21:04:50,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1425 events. 120/1425 cut-off events. For 4930/4930 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5743 event pairs, 0 based on Foata normal form. 6131/7375 useless extension candidates. Maximal degree in co-relation 1953. Up to 93 conditions per place. [2023-12-05 21:04:50,360 INFO L140 encePairwiseOnDemand]: 1311/1465 looper letters, 36 selfloop transitions, 1 changer transitions 0/1217 dead transitions. [2023-12-05 21:04:50,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1160 places, 1217 transitions, 3498 flow [2023-12-05 21:04:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3916 transitions. [2023-12-05 21:04:50,363 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8910125142207054 [2023-12-05 21:04:50,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3916 transitions. [2023-12-05 21:04:50,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3916 transitions. [2023-12-05 21:04:50,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:50,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3916 transitions. [2023-12-05 21:04:50,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1305.3333333333333) internal successors, (3916), 3 states have internal predecessors, (3916), 0 states have call successors, (0), 0 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:50,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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:50,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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:50,368 INFO L308 CegarLoopForPetriNet]: 1255 programPoint places, -95 predicate places. [2023-12-05 21:04:50,368 INFO L500 AbstractCegarLoop]: Abstraction has has 1160 places, 1217 transitions, 3498 flow [2023-12-05 21:04:50,368 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1244.0) internal successors, (3732), 3 states have internal predecessors, (3732), 0 states have call successors, (0), 0 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:50,368 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:50,369 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:50,369 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2023-12-05 21:04:50,369 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:50,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -318679353, now seen corresponding path program 1 times [2023-12-05 21:04:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:50,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279744849] [2023-12-05 21:04:50,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:50,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:50,401 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:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279744849] [2023-12-05 21:04:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279744849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:50,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:50,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:50,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549697434] [2023-12-05 21:04:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:50,402 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:50,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:50,404 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1243 out of 1465 [2023-12-05 21:04:50,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1160 places, 1217 transitions, 3498 flow. Second operand has 3 states, 3 states have (on average 1244.6666666666667) internal successors, (3734), 3 states have internal predecessors, (3734), 0 states have call successors, (0), 0 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:50,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:50,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1243 of 1465 [2023-12-05 21:04:50,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:51,290 INFO L124 PetriNetUnfolderBase]: 120/1394 cut-off events. [2023-12-05 21:04:51,290 INFO L125 PetriNetUnfolderBase]: For 4964/4964 co-relation queries the response was YES. [2023-12-05 21:04:51,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1394 events. 120/1394 cut-off events. For 4964/4964 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5518 event pairs, 0 based on Foata normal form. 0/1244 useless extension candidates. Maximal degree in co-relation 1952. Up to 62 conditions per place. [2023-12-05 21:04:51,423 INFO L140 encePairwiseOnDemand]: 1463/1465 looper letters, 34 selfloop transitions, 1 changer transitions 0/1216 dead transitions. [2023-12-05 21:04:51,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1161 places, 1216 transitions, 3564 flow [2023-12-05 21:04:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3765 transitions. [2023-12-05 21:04:51,425 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.856655290102389 [2023-12-05 21:04:51,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3765 transitions. [2023-12-05 21:04:51,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3765 transitions. [2023-12-05 21:04:51,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:51,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3765 transitions. [2023-12-05 21:04:51,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1255.0) internal successors, (3765), 3 states have internal predecessors, (3765), 0 states have call successors, (0), 0 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,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1465.0) internal successors, (5860), 4 states have internal predecessors, (5860), 0 states have call successors, (0), 0 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,430 INFO L308 CegarLoopForPetriNet]: 1255 programPoint places, -94 predicate places. [2023-12-05 21:04:51,431 INFO L500 AbstractCegarLoop]: Abstraction has has 1161 places, 1216 transitions, 3564 flow [2023-12-05 21:04:51,431 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1244.6666666666667) internal successors, (3734), 3 states have internal predecessors, (3734), 0 states have call successors, (0), 0 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,431 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:51,431 INFO L233 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,431 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2023-12-05 21:04:51,431 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:51,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1601491203, now seen corresponding path program 1 times [2023-12-05 21:04:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:51,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083106586] [2023-12-05 21:04:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:51,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:51,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:51,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:51,517 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:51,517 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:51,517 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:51,517 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:51,517 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2023-12-05 21:04:51,517 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:51,517 WARN L227 ceAbstractionStarter]: 30 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:51,517 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 31 thread instances. [2023-12-05 21:04:51,628 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:51,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1296 places, 1513 transitions, 4080 flow [2023-12-05 21:04:52,871 INFO L124 PetriNetUnfolderBase]: 311/1976 cut-off events. [2023-12-05 21:04:52,871 INFO L125 PetriNetUnfolderBase]: For 5425/5425 co-relation queries the response was YES. [2023-12-05 21:04:53,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2535 conditions, 1976 events. 311/1976 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8194 event pairs, 0 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 2431. Up to 64 conditions per place. [2023-12-05 21:04:53,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 1296 places, 1513 transitions, 4080 flow [2023-12-05 21:04:53,061 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1296 places, 1513 transitions, 4080 flow [2023-12-05 21:04:53,062 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:53,062 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:53,062 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:53,063 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:53,063 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:53,063 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:53,063 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:53,063 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:53,064 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:53,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash 383614447, now seen corresponding path program 1 times [2023-12-05 21:04:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591179821] [2023-12-05 21:04:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:53,093 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,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:53,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591179821] [2023-12-05 21:04:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591179821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:53,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742446538] [2023-12-05 21:04:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:53,093 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:53,096 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1283 out of 1513 [2023-12-05 21:04:53,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1296 places, 1513 transitions, 4080 flow. Second operand has 3 states, 3 states have (on average 1285.0) internal successors, (3855), 3 states have internal predecessors, (3855), 0 states have call successors, (0), 0 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,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:53,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1283 of 1513 [2023-12-05 21:04:53,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:54,101 INFO L124 PetriNetUnfolderBase]: 124/1472 cut-off events. [2023-12-05 21:04:54,102 INFO L125 PetriNetUnfolderBase]: For 5425/5425 co-relation queries the response was YES. [2023-12-05 21:04:54,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 1472 events. 124/1472 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5939 event pairs, 0 based on Foata normal form. 6567/7852 useless extension candidates. Maximal degree in co-relation 2035. Up to 96 conditions per place. [2023-12-05 21:04:54,249 INFO L140 encePairwiseOnDemand]: 1354/1513 looper letters, 37 selfloop transitions, 1 changer transitions 0/1257 dead transitions. [2023-12-05 21:04:54,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1198 places, 1257 transitions, 3644 flow [2023-12-05 21:04:54,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4045 transitions. [2023-12-05 21:04:54,252 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8911654549460234 [2023-12-05 21:04:54,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4045 transitions. [2023-12-05 21:04:54,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4045 transitions. [2023-12-05 21:04:54,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:54,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4045 transitions. [2023-12-05 21:04:54,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1348.3333333333333) internal successors, (4045), 3 states have internal predecessors, (4045), 0 states have call successors, (0), 0 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,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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,257 INFO L308 CegarLoopForPetriNet]: 1296 programPoint places, -98 predicate places. [2023-12-05 21:04:54,257 INFO L500 AbstractCegarLoop]: Abstraction has has 1198 places, 1257 transitions, 3644 flow [2023-12-05 21:04:54,258 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1285.0) internal successors, (3855), 3 states have internal predecessors, (3855), 0 states have call successors, (0), 0 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,258 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:54,258 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:54,258 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2023-12-05 21:04:54,258 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:54,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:54,258 INFO L85 PathProgramCache]: Analyzing trace with hash 383614448, now seen corresponding path program 1 times [2023-12-05 21:04:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:54,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154506733] [2023-12-05 21:04:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:54,295 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,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:54,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154506733] [2023-12-05 21:04:54,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154506733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:54,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:54,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731166120] [2023-12-05 21:04:54,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:54,296 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:54,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:54,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:54,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:54,299 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1284 out of 1513 [2023-12-05 21:04:54,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1198 places, 1257 transitions, 3644 flow. Second operand has 3 states, 3 states have (on average 1285.6666666666667) internal successors, (3857), 3 states have internal predecessors, (3857), 0 states have call successors, (0), 0 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,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:54,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1284 of 1513 [2023-12-05 21:04:54,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:55,373 INFO L124 PetriNetUnfolderBase]: 124/1440 cut-off events. [2023-12-05 21:04:55,373 INFO L125 PetriNetUnfolderBase]: For 5460/5460 co-relation queries the response was YES. [2023-12-05 21:04:55,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2136 conditions, 1440 events. 124/1440 cut-off events. For 5460/5460 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5708 event pairs, 0 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 2034. Up to 64 conditions per place. [2023-12-05 21:04:55,448 INFO L140 encePairwiseOnDemand]: 1511/1513 looper letters, 35 selfloop transitions, 1 changer transitions 0/1256 dead transitions. [2023-12-05 21:04:55,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1199 places, 1256 transitions, 3712 flow [2023-12-05 21:04:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3889 transitions. [2023-12-05 21:04:55,450 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8567966512447676 [2023-12-05 21:04:55,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 3889 transitions. [2023-12-05 21:04:55,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 3889 transitions. [2023-12-05 21:04:55,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:55,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 3889 transitions. [2023-12-05 21:04:55,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1296.3333333333333) internal successors, (3889), 3 states have internal predecessors, (3889), 0 states have call successors, (0), 0 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:55,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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:55,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1513.0) internal successors, (6052), 4 states have internal predecessors, (6052), 0 states have call successors, (0), 0 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:55,456 INFO L308 CegarLoopForPetriNet]: 1296 programPoint places, -97 predicate places. [2023-12-05 21:04:55,456 INFO L500 AbstractCegarLoop]: Abstraction has has 1199 places, 1256 transitions, 3712 flow [2023-12-05 21:04:55,456 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1285.6666666666667) internal successors, (3857), 3 states have internal predecessors, (3857), 0 states have call successors, (0), 0 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:55,456 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:55,457 INFO L233 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2023-12-05 21:04:55,457 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:55,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 712217468, now seen corresponding path program 1 times [2023-12-05 21:04:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:55,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524873115] [2023-12-05 21:04:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:55,499 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:55,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:55,547 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:55,547 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:55,547 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:55,547 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:55,547 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2023-12-05 21:04:55,547 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:55,548 WARN L227 ceAbstractionStarter]: 31 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:55,548 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 32 thread instances. [2023-12-05 21:04:55,691 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:55,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1337 places, 1561 transitions, 4242 flow [2023-12-05 21:04:56,996 INFO L124 PetriNetUnfolderBase]: 321/2039 cut-off events. [2023-12-05 21:04:56,996 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2023-12-05 21:04:57,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 2039 events. 321/2039 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8454 event pairs, 0 based on Foata normal form. 0/1619 useless extension candidates. Maximal degree in co-relation 2527. Up to 66 conditions per place. [2023-12-05 21:04:57,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 1337 places, 1561 transitions, 4242 flow [2023-12-05 21:04:57,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1337 places, 1561 transitions, 4242 flow [2023-12-05 21:04:57,279 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:57,280 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:57,280 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:57,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:57,281 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:04:57,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:57,283 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:57,283 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:57,284 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:57,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1440972472, now seen corresponding path program 1 times [2023-12-05 21:04:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260822065] [2023-12-05 21:04:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:57,314 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:57,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:57,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260822065] [2023-12-05 21:04:57,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260822065] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:57,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:57,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271870076] [2023-12-05 21:04:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:57,314 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:57,317 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1324 out of 1561 [2023-12-05 21:04:57,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1337 places, 1561 transitions, 4242 flow. Second operand has 3 states, 3 states have (on average 1326.0) internal successors, (3978), 3 states have internal predecessors, (3978), 0 states have call successors, (0), 0 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:57,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:57,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1324 of 1561 [2023-12-05 21:04:57,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:58,318 INFO L124 PetriNetUnfolderBase]: 128/1519 cut-off events. [2023-12-05 21:04:58,318 INFO L125 PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES. [2023-12-05 21:04:58,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1519 events. 128/1519 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6091 event pairs, 0 based on Foata normal form. 7018/8344 useless extension candidates. Maximal degree in co-relation 2118. Up to 99 conditions per place. [2023-12-05 21:04:58,479 INFO L140 encePairwiseOnDemand]: 1397/1561 looper letters, 38 selfloop transitions, 1 changer transitions 0/1297 dead transitions. [2023-12-05 21:04:58,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1236 places, 1297 transitions, 3792 flow [2023-12-05 21:04:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4174 transitions. [2023-12-05 21:04:58,482 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8913089899636985 [2023-12-05 21:04:58,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4174 transitions. [2023-12-05 21:04:58,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4174 transitions. [2023-12-05 21:04:58,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:58,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4174 transitions. [2023-12-05 21:04:58,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1391.3333333333333) internal successors, (4174), 3 states have internal predecessors, (4174), 0 states have call successors, (0), 0 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,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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,489 INFO L308 CegarLoopForPetriNet]: 1337 programPoint places, -101 predicate places. [2023-12-05 21:04:58,489 INFO L500 AbstractCegarLoop]: Abstraction has has 1236 places, 1297 transitions, 3792 flow [2023-12-05 21:04:58,489 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1326.0) internal successors, (3978), 3 states have internal predecessors, (3978), 0 states have call successors, (0), 0 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,489 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:58,489 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:58,489 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2023-12-05 21:04:58,489 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:58,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1440972471, now seen corresponding path program 1 times [2023-12-05 21:04:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435307855] [2023-12-05 21:04:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:58,526 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,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:58,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435307855] [2023-12-05 21:04:58,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435307855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:58,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323646203] [2023-12-05 21:04:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:58,527 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:58,529 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1325 out of 1561 [2023-12-05 21:04:58,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1236 places, 1297 transitions, 3792 flow. Second operand has 3 states, 3 states have (on average 1326.6666666666667) internal successors, (3980), 3 states have internal predecessors, (3980), 0 states have call successors, (0), 0 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,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:58,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1325 of 1561 [2023-12-05 21:04:58,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:59,586 INFO L124 PetriNetUnfolderBase]: 128/1486 cut-off events. [2023-12-05 21:04:59,586 INFO L125 PetriNetUnfolderBase]: For 5988/5988 co-relation queries the response was YES. [2023-12-05 21:04:59,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1486 events. 128/1486 cut-off events. For 5988/5988 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 5892 event pairs, 0 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2117. Up to 66 conditions per place. [2023-12-05 21:04:59,701 INFO L140 encePairwiseOnDemand]: 1559/1561 looper letters, 36 selfloop transitions, 1 changer transitions 0/1296 dead transitions. [2023-12-05 21:04:59,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1237 places, 1296 transitions, 3862 flow [2023-12-05 21:04:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4013 transitions. [2023-12-05 21:04:59,704 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8569293188127269 [2023-12-05 21:04:59,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4013 transitions. [2023-12-05 21:04:59,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4013 transitions. [2023-12-05 21:04:59,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:59,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4013 transitions. [2023-12-05 21:04:59,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1337.6666666666667) internal successors, (4013), 3 states have internal predecessors, (4013), 0 states have call successors, (0), 0 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:59,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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:59,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1561.0) internal successors, (6244), 4 states have internal predecessors, (6244), 0 states have call successors, (0), 0 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:59,710 INFO L308 CegarLoopForPetriNet]: 1337 programPoint places, -100 predicate places. [2023-12-05 21:04:59,710 INFO L500 AbstractCegarLoop]: Abstraction has has 1237 places, 1296 transitions, 3862 flow [2023-12-05 21:04:59,711 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1326.6666666666667) internal successors, (3980), 3 states have internal predecessors, (3980), 0 states have call successors, (0), 0 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:59,711 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:59,711 INFO L233 CegarLoopForPetriNet]: trace histogram [33, 33, 33, 33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,711 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2023-12-05 21:04:59,711 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:59,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1491019264, now seen corresponding path program 1 times [2023-12-05 21:04:59,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881709899] [2023-12-05 21:04:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:59,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:59,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:59,813 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:59,813 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:59,813 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:59,813 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:59,814 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2023-12-05 21:04:59,814 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:59,814 WARN L227 ceAbstractionStarter]: 32 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:59,814 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 33 thread instances. [2023-12-05 21:04:59,931 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:59,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1378 places, 1609 transitions, 4406 flow [2023-12-05 21:05:01,312 INFO L124 PetriNetUnfolderBase]: 331/2102 cut-off events. [2023-12-05 21:05:01,312 INFO L125 PetriNetUnfolderBase]: For 6512/6512 co-relation queries the response was YES. [2023-12-05 21:05:01,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 2102 events. 331/2102 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 8724 event pairs, 0 based on Foata normal form. 0/1669 useless extension candidates. Maximal degree in co-relation 2624. Up to 68 conditions per place. [2023-12-05 21:05:01,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 1378 places, 1609 transitions, 4406 flow [2023-12-05 21:05:01,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1378 places, 1609 transitions, 4406 flow [2023-12-05 21:05:01,605 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:01,605 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:01,605 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:01,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:01,606 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:01,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:01,606 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:01,609 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:01,609 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:01,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:01,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1497472815, now seen corresponding path program 1 times [2023-12-05 21:05:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:01,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988807572] [2023-12-05 21:05:01,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:01,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:01,660 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:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988807572] [2023-12-05 21:05:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988807572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:01,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:01,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:01,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863146728] [2023-12-05 21:05:01,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:01,661 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:01,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:01,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:01,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:01,664 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1365 out of 1609 [2023-12-05 21:05:01,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1378 places, 1609 transitions, 4406 flow. Second operand has 3 states, 3 states have (on average 1367.0) internal successors, (4101), 3 states have internal predecessors, (4101), 0 states have call successors, (0), 0 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:01,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:01,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1365 of 1609 [2023-12-05 21:05:01,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:02,780 INFO L124 PetriNetUnfolderBase]: 132/1566 cut-off events. [2023-12-05 21:05:02,781 INFO L125 PetriNetUnfolderBase]: For 6512/6512 co-relation queries the response was YES. [2023-12-05 21:05:02,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 1566 events. 132/1566 cut-off events. For 6512/6512 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6337 event pairs, 0 based on Foata normal form. 7484/8851 useless extension candidates. Maximal degree in co-relation 2202. Up to 102 conditions per place. [2023-12-05 21:05:02,951 INFO L140 encePairwiseOnDemand]: 1440/1609 looper letters, 39 selfloop transitions, 1 changer transitions 0/1337 dead transitions. [2023-12-05 21:05:02,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1274 places, 1337 transitions, 3942 flow [2023-12-05 21:05:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4303 transitions. [2023-12-05 21:05:02,955 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8914439610524135 [2023-12-05 21:05:02,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4303 transitions. [2023-12-05 21:05:02,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4303 transitions. [2023-12-05 21:05:02,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:02,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4303 transitions. [2023-12-05 21:05:02,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1434.3333333333333) internal successors, (4303), 3 states have internal predecessors, (4303), 0 states have call successors, (0), 0 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:02,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:02,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:02,961 INFO L308 CegarLoopForPetriNet]: 1378 programPoint places, -104 predicate places. [2023-12-05 21:05:02,961 INFO L500 AbstractCegarLoop]: Abstraction has has 1274 places, 1337 transitions, 3942 flow [2023-12-05 21:05:02,961 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1367.0) internal successors, (4101), 3 states have internal predecessors, (4101), 0 states have call successors, (0), 0 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:02,961 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:02,961 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:02,962 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2023-12-05 21:05:02,962 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:02,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1497472814, now seen corresponding path program 1 times [2023-12-05 21:05:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335746582] [2023-12-05 21:05:02,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:02,999 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:03,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335746582] [2023-12-05 21:05:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335746582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:03,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:03,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421197468] [2023-12-05 21:05:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:03,000 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:03,003 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1366 out of 1609 [2023-12-05 21:05:03,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1274 places, 1337 transitions, 3942 flow. Second operand has 3 states, 3 states have (on average 1367.6666666666667) internal successors, (4103), 3 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:03,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:03,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1366 of 1609 [2023-12-05 21:05:03,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:04,106 INFO L124 PetriNetUnfolderBase]: 132/1532 cut-off events. [2023-12-05 21:05:04,106 INFO L125 PetriNetUnfolderBase]: For 6549/6549 co-relation queries the response was YES. [2023-12-05 21:05:04,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1532 events. 132/1532 cut-off events. For 6549/6549 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6074 event pairs, 0 based on Foata normal form. 0/1367 useless extension candidates. Maximal degree in co-relation 2201. Up to 68 conditions per place. [2023-12-05 21:05:04,276 INFO L140 encePairwiseOnDemand]: 1607/1609 looper letters, 37 selfloop transitions, 1 changer transitions 0/1336 dead transitions. [2023-12-05 21:05:04,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1275 places, 1336 transitions, 4014 flow [2023-12-05 21:05:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4137 transitions. [2023-12-05 21:05:04,279 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8570540708514606 [2023-12-05 21:05:04,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4137 transitions. [2023-12-05 21:05:04,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4137 transitions. [2023-12-05 21:05:04,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:04,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4137 transitions. [2023-12-05 21:05:04,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1379.0) internal successors, (4137), 3 states have internal predecessors, (4137), 0 states have call successors, (0), 0 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:04,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:04,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1609.0) internal successors, (6436), 4 states have internal predecessors, (6436), 0 states have call successors, (0), 0 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:04,285 INFO L308 CegarLoopForPetriNet]: 1378 programPoint places, -103 predicate places. [2023-12-05 21:05:04,285 INFO L500 AbstractCegarLoop]: Abstraction has has 1275 places, 1336 transitions, 4014 flow [2023-12-05 21:05:04,285 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1367.6666666666667) internal successors, (4103), 3 states have internal predecessors, (4103), 0 states have call successors, (0), 0 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:04,285 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:04,285 INFO L233 CegarLoopForPetriNet]: trace histogram [34, 34, 34, 34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:04,285 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2023-12-05 21:05:04,286 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:04,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -623200547, now seen corresponding path program 1 times [2023-12-05 21:05:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:04,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135263504] [2023-12-05 21:05:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:04,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:04,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:04,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:04,391 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:04,391 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:04,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:04,391 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:04,391 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2023-12-05 21:05:04,391 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:04,392 WARN L227 ceAbstractionStarter]: 33 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:04,392 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 34 thread instances. [2023-12-05 21:05:04,513 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:04,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1419 places, 1657 transitions, 4572 flow [2023-12-05 21:05:06,018 INFO L124 PetriNetUnfolderBase]: 341/2165 cut-off events. [2023-12-05 21:05:06,019 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2023-12-05 21:05:06,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2165 events. 341/2165 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9014 event pairs, 0 based on Foata normal form. 0/1719 useless extension candidates. Maximal degree in co-relation 2722. Up to 70 conditions per place. [2023-12-05 21:05:06,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 1419 places, 1657 transitions, 4572 flow [2023-12-05 21:05:06,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1419 places, 1657 transitions, 4572 flow [2023-12-05 21:05:06,266 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:06,266 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:06,266 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:06,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:06,267 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:06,267 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:06,267 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:06,268 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:06,268 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:06,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:06,268 INFO L85 PathProgramCache]: Analyzing trace with hash 214113418, now seen corresponding path program 1 times [2023-12-05 21:05:06,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:06,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348739985] [2023-12-05 21:05:06,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:06,299 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:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:06,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348739985] [2023-12-05 21:05:06,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348739985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:06,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:06,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690653495] [2023-12-05 21:05:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:06,300 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:06,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:06,303 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1406 out of 1657 [2023-12-05 21:05:06,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1419 places, 1657 transitions, 4572 flow. Second operand has 3 states, 3 states have (on average 1408.0) internal successors, (4224), 3 states have internal predecessors, (4224), 0 states have call successors, (0), 0 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:06,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:06,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1406 of 1657 [2023-12-05 21:05:06,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:07,582 INFO L124 PetriNetUnfolderBase]: 136/1613 cut-off events. [2023-12-05 21:05:07,582 INFO L125 PetriNetUnfolderBase]: For 7106/7106 co-relation queries the response was YES. [2023-12-05 21:05:07,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1613 events. 136/1613 cut-off events. For 7106/7106 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6525 event pairs, 0 based on Foata normal form. 7965/9373 useless extension candidates. Maximal degree in co-relation 2287. Up to 105 conditions per place. [2023-12-05 21:05:07,675 INFO L140 encePairwiseOnDemand]: 1483/1657 looper letters, 40 selfloop transitions, 1 changer transitions 0/1377 dead transitions. [2023-12-05 21:05:07,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1312 places, 1377 transitions, 4094 flow [2023-12-05 21:05:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4432 transitions. [2023-12-05 21:05:07,678 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8915711124522229 [2023-12-05 21:05:07,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4432 transitions. [2023-12-05 21:05:07,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4432 transitions. [2023-12-05 21:05:07,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:07,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4432 transitions. [2023-12-05 21:05:07,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1477.3333333333333) internal successors, (4432), 3 states have internal predecessors, (4432), 0 states have call successors, (0), 0 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:07,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:07,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:07,685 INFO L308 CegarLoopForPetriNet]: 1419 programPoint places, -107 predicate places. [2023-12-05 21:05:07,685 INFO L500 AbstractCegarLoop]: Abstraction has has 1312 places, 1377 transitions, 4094 flow [2023-12-05 21:05:07,685 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1408.0) internal successors, (4224), 3 states have internal predecessors, (4224), 0 states have call successors, (0), 0 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:07,685 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:07,685 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:07,685 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2023-12-05 21:05:07,685 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:07,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash 214113419, now seen corresponding path program 1 times [2023-12-05 21:05:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132165766] [2023-12-05 21:05:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:07,725 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:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132165766] [2023-12-05 21:05:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132165766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799776778] [2023-12-05 21:05:07,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:07,726 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:07,728 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1407 out of 1657 [2023-12-05 21:05:07,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1312 places, 1377 transitions, 4094 flow. Second operand has 3 states, 3 states have (on average 1408.6666666666667) internal successors, (4226), 3 states have internal predecessors, (4226), 0 states have call successors, (0), 0 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:07,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:07,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1407 of 1657 [2023-12-05 21:05:07,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:08,843 INFO L124 PetriNetUnfolderBase]: 136/1578 cut-off events. [2023-12-05 21:05:08,844 INFO L125 PetriNetUnfolderBase]: For 7144/7144 co-relation queries the response was YES. [2023-12-05 21:05:08,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 1578 events. 136/1578 cut-off events. For 7144/7144 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6253 event pairs, 0 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 2286. Up to 70 conditions per place. [2023-12-05 21:05:09,029 INFO L140 encePairwiseOnDemand]: 1655/1657 looper letters, 38 selfloop transitions, 1 changer transitions 0/1376 dead transitions. [2023-12-05 21:05:09,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1313 places, 1376 transitions, 4168 flow [2023-12-05 21:05:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4261 transitions. [2023-12-05 21:05:09,032 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8571715952524643 [2023-12-05 21:05:09,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4261 transitions. [2023-12-05 21:05:09,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4261 transitions. [2023-12-05 21:05:09,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:09,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4261 transitions. [2023-12-05 21:05:09,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1420.3333333333333) internal successors, (4261), 3 states have internal predecessors, (4261), 0 states have call successors, (0), 0 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:09,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:09,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1657.0) internal successors, (6628), 4 states have internal predecessors, (6628), 0 states have call successors, (0), 0 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:09,038 INFO L308 CegarLoopForPetriNet]: 1419 programPoint places, -106 predicate places. [2023-12-05 21:05:09,038 INFO L500 AbstractCegarLoop]: Abstraction has has 1313 places, 1376 transitions, 4168 flow [2023-12-05 21:05:09,039 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1408.6666666666667) internal successors, (4226), 3 states have internal predecessors, (4226), 0 states have call successors, (0), 0 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:09,039 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:09,039 INFO L233 CegarLoopForPetriNet]: trace histogram [35, 35, 35, 35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:09,039 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2023-12-05 21:05:09,039 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:09,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 794832381, now seen corresponding path program 1 times [2023-12-05 21:05:09,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:09,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395176723] [2023-12-05 21:05:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:09,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:09,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:09,149 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:09,149 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:09,149 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:09,149 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:09,149 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2023-12-05 21:05:09,149 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:09,149 WARN L227 ceAbstractionStarter]: 34 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:09,149 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 35 thread instances. [2023-12-05 21:05:09,275 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1460 places, 1705 transitions, 4740 flow [2023-12-05 21:05:11,235 INFO L124 PetriNetUnfolderBase]: 351/2228 cut-off events. [2023-12-05 21:05:11,236 INFO L125 PetriNetUnfolderBase]: For 7735/7735 co-relation queries the response was YES. [2023-12-05 21:05:11,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 2228 events. 351/2228 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9265 event pairs, 0 based on Foata normal form. 0/1769 useless extension candidates. Maximal degree in co-relation 2821. Up to 72 conditions per place. [2023-12-05 21:05:11,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 1460 places, 1705 transitions, 4740 flow [2023-12-05 21:05:11,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1460 places, 1705 transitions, 4740 flow [2023-12-05 21:05:11,421 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:11,421 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:11,421 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:11,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:11,422 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:11,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:11,422 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:11,422 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:11,423 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:11,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash -601181069, now seen corresponding path program 1 times [2023-12-05 21:05:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:11,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478680255] [2023-12-05 21:05:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:11,478 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:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478680255] [2023-12-05 21:05:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478680255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:11,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253067765] [2023-12-05 21:05:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:11,479 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:11,482 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1447 out of 1705 [2023-12-05 21:05:11,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1460 places, 1705 transitions, 4740 flow. Second operand has 3 states, 3 states have (on average 1449.0) internal successors, (4347), 3 states have internal predecessors, (4347), 0 states have call successors, (0), 0 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:11,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:11,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1447 of 1705 [2023-12-05 21:05:11,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:12,900 INFO L124 PetriNetUnfolderBase]: 140/1660 cut-off events. [2023-12-05 21:05:12,901 INFO L125 PetriNetUnfolderBase]: For 7735/7735 co-relation queries the response was YES. [2023-12-05 21:05:12,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2474 conditions, 1660 events. 140/1660 cut-off events. For 7735/7735 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6676 event pairs, 0 based on Foata normal form. 8461/9910 useless extension candidates. Maximal degree in co-relation 2373. Up to 108 conditions per place. [2023-12-05 21:05:12,993 INFO L140 encePairwiseOnDemand]: 1526/1705 looper letters, 41 selfloop transitions, 1 changer transitions 0/1417 dead transitions. [2023-12-05 21:05:12,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1350 places, 1417 transitions, 4248 flow [2023-12-05 21:05:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4561 transitions. [2023-12-05 21:05:12,996 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8916911045943304 [2023-12-05 21:05:12,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4561 transitions. [2023-12-05 21:05:12,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4561 transitions. [2023-12-05 21:05:12,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:12,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4561 transitions. [2023-12-05 21:05:12,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1520.3333333333333) internal successors, (4561), 3 states have internal predecessors, (4561), 0 states have call successors, (0), 0 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:13,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:13,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:13,003 INFO L308 CegarLoopForPetriNet]: 1460 programPoint places, -110 predicate places. [2023-12-05 21:05:13,003 INFO L500 AbstractCegarLoop]: Abstraction has has 1350 places, 1417 transitions, 4248 flow [2023-12-05 21:05:13,003 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1449.0) internal successors, (4347), 3 states have internal predecessors, (4347), 0 states have call successors, (0), 0 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:13,003 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:13,003 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:13,003 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2023-12-05 21:05:13,003 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:13,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -601181068, now seen corresponding path program 1 times [2023-12-05 21:05:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265543359] [2023-12-05 21:05:13,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:13,039 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:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:13,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265543359] [2023-12-05 21:05:13,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265543359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:13,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:13,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719961509] [2023-12-05 21:05:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:13,040 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:13,043 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1448 out of 1705 [2023-12-05 21:05:13,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1350 places, 1417 transitions, 4248 flow. Second operand has 3 states, 3 states have (on average 1449.6666666666667) internal successors, (4349), 3 states have internal predecessors, (4349), 0 states have call successors, (0), 0 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:13,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:13,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1448 of 1705 [2023-12-05 21:05:13,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:14,284 INFO L124 PetriNetUnfolderBase]: 140/1624 cut-off events. [2023-12-05 21:05:14,284 INFO L125 PetriNetUnfolderBase]: For 7774/7774 co-relation queries the response was YES. [2023-12-05 21:05:14,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2478 conditions, 1624 events. 140/1624 cut-off events. For 7774/7774 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6473 event pairs, 0 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 2372. Up to 72 conditions per place. [2023-12-05 21:05:14,405 INFO L140 encePairwiseOnDemand]: 1703/1705 looper letters, 39 selfloop transitions, 1 changer transitions 0/1416 dead transitions. [2023-12-05 21:05:14,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1351 places, 1416 transitions, 4324 flow [2023-12-05 21:05:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:14,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4385 transitions. [2023-12-05 21:05:14,408 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8572825024437928 [2023-12-05 21:05:14,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4385 transitions. [2023-12-05 21:05:14,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4385 transitions. [2023-12-05 21:05:14,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:14,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4385 transitions. [2023-12-05 21:05:14,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1461.6666666666667) internal successors, (4385), 3 states have internal predecessors, (4385), 0 states have call successors, (0), 0 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:14,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:14,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1705.0) internal successors, (6820), 4 states have internal predecessors, (6820), 0 states have call successors, (0), 0 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:14,414 INFO L308 CegarLoopForPetriNet]: 1460 programPoint places, -109 predicate places. [2023-12-05 21:05:14,414 INFO L500 AbstractCegarLoop]: Abstraction has has 1351 places, 1416 transitions, 4324 flow [2023-12-05 21:05:14,414 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1449.6666666666667) internal successors, (4349), 3 states have internal predecessors, (4349), 0 states have call successors, (0), 0 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:14,414 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:14,414 INFO L233 CegarLoopForPetriNet]: trace histogram [36, 36, 36, 36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:14,415 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2023-12-05 21:05:14,415 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:14,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1234767870, now seen corresponding path program 1 times [2023-12-05 21:05:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595784990] [2023-12-05 21:05:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:14,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:14,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:14,652 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:14,652 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:14,653 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:14,653 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:14,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2023-12-05 21:05:14,653 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:14,653 WARN L227 ceAbstractionStarter]: 35 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:14,653 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 36 thread instances. [2023-12-05 21:05:14,792 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:14,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1501 places, 1753 transitions, 4910 flow [2023-12-05 21:05:16,650 INFO L124 PetriNetUnfolderBase]: 361/2291 cut-off events. [2023-12-05 21:05:16,651 INFO L125 PetriNetUnfolderBase]: For 8400/8400 co-relation queries the response was YES. [2023-12-05 21:05:16,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3030 conditions, 2291 events. 361/2291 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9594 event pairs, 0 based on Foata normal form. 0/1819 useless extension candidates. Maximal degree in co-relation 2921. Up to 74 conditions per place. [2023-12-05 21:05:16,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 1501 places, 1753 transitions, 4910 flow [2023-12-05 21:05:16,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1501 places, 1753 transitions, 4910 flow [2023-12-05 21:05:16,956 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:16,956 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:16,956 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:16,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:16,957 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:16,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:16,957 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:16,957 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:16,957 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:16,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 351611020, now seen corresponding path program 1 times [2023-12-05 21:05:16,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:16,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171351643] [2023-12-05 21:05:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:16,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:16,991 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:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:16,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171351643] [2023-12-05 21:05:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171351643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:16,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825583899] [2023-12-05 21:05:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:16,992 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:16,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:16,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:16,996 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1488 out of 1753 [2023-12-05 21:05:16,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1501 places, 1753 transitions, 4910 flow. Second operand has 3 states, 3 states have (on average 1490.0) internal successors, (4470), 3 states have internal predecessors, (4470), 0 states have call successors, (0), 0 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:16,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:16,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1488 of 1753 [2023-12-05 21:05:16,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:18,480 INFO L124 PetriNetUnfolderBase]: 144/1707 cut-off events. [2023-12-05 21:05:18,480 INFO L125 PetriNetUnfolderBase]: For 8400/8400 co-relation queries the response was YES. [2023-12-05 21:05:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 1707 events. 144/1707 cut-off events. For 8400/8400 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6933 event pairs, 0 based on Foata normal form. 8972/10462 useless extension candidates. Maximal degree in co-relation 2460. Up to 111 conditions per place. [2023-12-05 21:05:18,598 INFO L140 encePairwiseOnDemand]: 1569/1753 looper letters, 42 selfloop transitions, 1 changer transitions 0/1457 dead transitions. [2023-12-05 21:05:18,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1388 places, 1457 transitions, 4404 flow [2023-12-05 21:05:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4690 transitions. [2023-12-05 21:05:18,600 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8918045255752044 [2023-12-05 21:05:18,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4690 transitions. [2023-12-05 21:05:18,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4690 transitions. [2023-12-05 21:05:18,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:18,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4690 transitions. [2023-12-05 21:05:18,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1563.3333333333333) internal successors, (4690), 3 states have internal predecessors, (4690), 0 states have call successors, (0), 0 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:18,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:18,606 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:18,606 INFO L308 CegarLoopForPetriNet]: 1501 programPoint places, -113 predicate places. [2023-12-05 21:05:18,607 INFO L500 AbstractCegarLoop]: Abstraction has has 1388 places, 1457 transitions, 4404 flow [2023-12-05 21:05:18,607 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1490.0) internal successors, (4470), 3 states have internal predecessors, (4470), 0 states have call successors, (0), 0 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:18,607 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:18,607 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:18,607 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2023-12-05 21:05:18,607 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:18,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash 351611021, now seen corresponding path program 1 times [2023-12-05 21:05:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:18,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912215847] [2023-12-05 21:05:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:18,643 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:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:18,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912215847] [2023-12-05 21:05:18,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912215847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:18,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:18,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080114099] [2023-12-05 21:05:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:18,644 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:18,646 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1489 out of 1753 [2023-12-05 21:05:18,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1388 places, 1457 transitions, 4404 flow. Second operand has 3 states, 3 states have (on average 1490.6666666666667) internal successors, (4472), 3 states have internal predecessors, (4472), 0 states have call successors, (0), 0 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:18,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:18,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1489 of 1753 [2023-12-05 21:05:18,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:19,994 INFO L124 PetriNetUnfolderBase]: 144/1670 cut-off events. [2023-12-05 21:05:19,994 INFO L125 PetriNetUnfolderBase]: For 8440/8440 co-relation queries the response was YES. [2023-12-05 21:05:20,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 1670 events. 144/1670 cut-off events. For 8440/8440 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6662 event pairs, 0 based on Foata normal form. 0/1490 useless extension candidates. Maximal degree in co-relation 2459. Up to 74 conditions per place. [2023-12-05 21:05:20,127 INFO L140 encePairwiseOnDemand]: 1751/1753 looper letters, 40 selfloop transitions, 1 changer transitions 0/1456 dead transitions. [2023-12-05 21:05:20,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1389 places, 1456 transitions, 4482 flow [2023-12-05 21:05:20,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4509 transitions. [2023-12-05 21:05:20,129 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8573873359954364 [2023-12-05 21:05:20,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4509 transitions. [2023-12-05 21:05:20,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4509 transitions. [2023-12-05 21:05:20,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:20,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4509 transitions. [2023-12-05 21:05:20,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1503.0) internal successors, (4509), 3 states have internal predecessors, (4509), 0 states have call successors, (0), 0 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:20,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:20,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1753.0) internal successors, (7012), 4 states have internal predecessors, (7012), 0 states have call successors, (0), 0 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:20,136 INFO L308 CegarLoopForPetriNet]: 1501 programPoint places, -112 predicate places. [2023-12-05 21:05:20,136 INFO L500 AbstractCegarLoop]: Abstraction has has 1389 places, 1456 transitions, 4482 flow [2023-12-05 21:05:20,136 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1490.6666666666667) internal successors, (4472), 3 states have internal predecessors, (4472), 0 states have call successors, (0), 0 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:20,136 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:20,136 INFO L233 CegarLoopForPetriNet]: trace histogram [37, 37, 37, 37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:20,137 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2023-12-05 21:05:20,137 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:20,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2116655878, now seen corresponding path program 1 times [2023-12-05 21:05:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435178739] [2023-12-05 21:05:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:20,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:20,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:20,365 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:20,365 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:20,365 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:20,365 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:20,365 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2023-12-05 21:05:20,365 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:20,366 WARN L227 ceAbstractionStarter]: 36 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:20,366 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 37 thread instances. [2023-12-05 21:05:20,519 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:20,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1542 places, 1801 transitions, 5082 flow [2023-12-05 21:05:22,598 INFO L124 PetriNetUnfolderBase]: 371/2354 cut-off events. [2023-12-05 21:05:22,598 INFO L125 PetriNetUnfolderBase]: For 9102/9102 co-relation queries the response was YES. [2023-12-05 21:05:22,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3132 conditions, 2354 events. 371/2354 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 9822 event pairs, 0 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 3022. Up to 76 conditions per place. [2023-12-05 21:05:22,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 1542 places, 1801 transitions, 5082 flow [2023-12-05 21:05:22,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1542 places, 1801 transitions, 5082 flow [2023-12-05 21:05:22,808 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:22,808 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:22,808 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:22,809 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:22,809 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:22,809 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:22,809 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:22,810 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:22,811 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:22,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1222477611, now seen corresponding path program 1 times [2023-12-05 21:05:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403800454] [2023-12-05 21:05:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:22,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:22,856 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:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403800454] [2023-12-05 21:05:22,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403800454] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124483173] [2023-12-05 21:05:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:22,857 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:22,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:22,860 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1529 out of 1801 [2023-12-05 21:05:22,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1542 places, 1801 transitions, 5082 flow. Second operand has 3 states, 3 states have (on average 1531.0) internal successors, (4593), 3 states have internal predecessors, (4593), 0 states have call successors, (0), 0 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:22,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:22,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1529 of 1801 [2023-12-05 21:05:22,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:24,484 INFO L124 PetriNetUnfolderBase]: 148/1754 cut-off events. [2023-12-05 21:05:24,485 INFO L125 PetriNetUnfolderBase]: For 9102/9102 co-relation queries the response was YES. [2023-12-05 21:05:24,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1754 events. 148/1754 cut-off events. For 9102/9102 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7125 event pairs, 0 based on Foata normal form. 9498/11029 useless extension candidates. Maximal degree in co-relation 2548. Up to 114 conditions per place. [2023-12-05 21:05:24,610 INFO L140 encePairwiseOnDemand]: 1612/1801 looper letters, 43 selfloop transitions, 1 changer transitions 0/1497 dead transitions. [2023-12-05 21:05:24,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1426 places, 1497 transitions, 4562 flow [2023-12-05 21:05:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4819 transitions. [2023-12-05 21:05:24,614 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8919119007958541 [2023-12-05 21:05:24,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4819 transitions. [2023-12-05 21:05:24,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4819 transitions. [2023-12-05 21:05:24,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:24,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4819 transitions. [2023-12-05 21:05:24,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1606.3333333333333) internal successors, (4819), 3 states have internal predecessors, (4819), 0 states have call successors, (0), 0 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:24,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:24,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:24,621 INFO L308 CegarLoopForPetriNet]: 1542 programPoint places, -116 predicate places. [2023-12-05 21:05:24,621 INFO L500 AbstractCegarLoop]: Abstraction has has 1426 places, 1497 transitions, 4562 flow [2023-12-05 21:05:24,621 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1531.0) internal successors, (4593), 3 states have internal predecessors, (4593), 0 states have call successors, (0), 0 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:24,621 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:24,621 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:24,622 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2023-12-05 21:05:24,622 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:24,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:24,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1222477610, now seen corresponding path program 1 times [2023-12-05 21:05:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:24,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040053467] [2023-12-05 21:05:24,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:24,669 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:24,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:24,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040053467] [2023-12-05 21:05:24,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040053467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:24,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:24,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688862138] [2023-12-05 21:05:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:24,670 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:24,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:24,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:24,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:24,673 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1530 out of 1801 [2023-12-05 21:05:24,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1426 places, 1497 transitions, 4562 flow. Second operand has 3 states, 3 states have (on average 1531.6666666666667) internal successors, (4595), 3 states have internal predecessors, (4595), 0 states have call successors, (0), 0 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:24,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:24,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1530 of 1801 [2023-12-05 21:05:24,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:26,092 INFO L124 PetriNetUnfolderBase]: 148/1716 cut-off events. [2023-12-05 21:05:26,092 INFO L125 PetriNetUnfolderBase]: For 9143/9143 co-relation queries the response was YES. [2023-12-05 21:05:26,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 1716 events. 148/1716 cut-off events. For 9143/9143 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 6839 event pairs, 0 based on Foata normal form. 0/1531 useless extension candidates. Maximal degree in co-relation 2547. Up to 76 conditions per place. [2023-12-05 21:05:26,233 INFO L140 encePairwiseOnDemand]: 1799/1801 looper letters, 41 selfloop transitions, 1 changer transitions 0/1496 dead transitions. [2023-12-05 21:05:26,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1427 places, 1496 transitions, 4642 flow [2023-12-05 21:05:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4633 transitions. [2023-12-05 21:05:26,236 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8574865815287803 [2023-12-05 21:05:26,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4633 transitions. [2023-12-05 21:05:26,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4633 transitions. [2023-12-05 21:05:26,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:26,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4633 transitions. [2023-12-05 21:05:26,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1544.3333333333333) internal successors, (4633), 3 states have internal predecessors, (4633), 0 states have call successors, (0), 0 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:26,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:26,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1801.0) internal successors, (7204), 4 states have internal predecessors, (7204), 0 states have call successors, (0), 0 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:26,242 INFO L308 CegarLoopForPetriNet]: 1542 programPoint places, -115 predicate places. [2023-12-05 21:05:26,242 INFO L500 AbstractCegarLoop]: Abstraction has has 1427 places, 1496 transitions, 4642 flow [2023-12-05 21:05:26,242 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1531.6666666666667) internal successors, (4595), 3 states have internal predecessors, (4595), 0 states have call successors, (0), 0 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:26,242 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:26,242 INFO L233 CegarLoopForPetriNet]: trace histogram [38, 38, 38, 38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:26,243 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2023-12-05 21:05:26,243 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:26,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1684866783, now seen corresponding path program 1 times [2023-12-05 21:05:26,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:26,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849945365] [2023-12-05 21:05:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:26,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:26,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:26,451 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:26,451 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:26,451 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:26,451 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:26,451 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2023-12-05 21:05:26,451 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:26,452 WARN L227 ceAbstractionStarter]: 37 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:26,452 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 38 thread instances. [2023-12-05 21:05:26,583 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:26,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1583 places, 1849 transitions, 5256 flow [2023-12-05 21:05:28,624 INFO L124 PetriNetUnfolderBase]: 381/2417 cut-off events. [2023-12-05 21:05:28,625 INFO L125 PetriNetUnfolderBase]: For 9842/9842 co-relation queries the response was YES. [2023-12-05 21:05:28,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 2417 events. 381/2417 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 10048 event pairs, 0 based on Foata normal form. 0/1919 useless extension candidates. Maximal degree in co-relation 3124. Up to 78 conditions per place. [2023-12-05 21:05:28,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 1583 places, 1849 transitions, 5256 flow [2023-12-05 21:05:28,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1583 places, 1849 transitions, 5256 flow [2023-12-05 21:05:28,876 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:28,876 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:28,876 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:28,878 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:28,878 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:28,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:28,878 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:28,878 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:28,878 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:28,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1028479666, now seen corresponding path program 1 times [2023-12-05 21:05:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302718525] [2023-12-05 21:05:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:28,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:28,925 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:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302718525] [2023-12-05 21:05:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302718525] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:28,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388191054] [2023-12-05 21:05:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:28,926 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:28,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:28,929 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1570 out of 1849 [2023-12-05 21:05:28,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1583 places, 1849 transitions, 5256 flow. Second operand has 3 states, 3 states have (on average 1572.0) internal successors, (4716), 3 states have internal predecessors, (4716), 0 states have call successors, (0), 0 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:28,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:28,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1570 of 1849 [2023-12-05 21:05:28,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:30,626 INFO L124 PetriNetUnfolderBase]: 152/1801 cut-off events. [2023-12-05 21:05:30,627 INFO L125 PetriNetUnfolderBase]: For 9842/9842 co-relation queries the response was YES. [2023-12-05 21:05:30,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 1801 events. 152/1801 cut-off events. For 9842/9842 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7327 event pairs, 0 based on Foata normal form. 10039/11611 useless extension candidates. Maximal degree in co-relation 2637. Up to 117 conditions per place. [2023-12-05 21:05:30,742 INFO L140 encePairwiseOnDemand]: 1655/1849 looper letters, 44 selfloop transitions, 1 changer transitions 0/1537 dead transitions. [2023-12-05 21:05:30,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1464 places, 1537 transitions, 4722 flow [2023-12-05 21:05:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4948 transitions. [2023-12-05 21:05:30,746 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8920137010996936 [2023-12-05 21:05:30,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4948 transitions. [2023-12-05 21:05:30,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4948 transitions. [2023-12-05 21:05:30,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:30,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4948 transitions. [2023-12-05 21:05:30,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1649.3333333333333) internal successors, (4948), 3 states have internal predecessors, (4948), 0 states have call successors, (0), 0 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,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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,752 INFO L308 CegarLoopForPetriNet]: 1583 programPoint places, -119 predicate places. [2023-12-05 21:05:30,752 INFO L500 AbstractCegarLoop]: Abstraction has has 1464 places, 1537 transitions, 4722 flow [2023-12-05 21:05:30,753 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1572.0) internal successors, (4716), 3 states have internal predecessors, (4716), 0 states have call successors, (0), 0 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,753 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:30,753 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:30,753 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2023-12-05 21:05:30,753 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:30,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1028479665, now seen corresponding path program 1 times [2023-12-05 21:05:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:30,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099655345] [2023-12-05 21:05:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:30,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:30,800 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,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099655345] [2023-12-05 21:05:30,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099655345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:30,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103338784] [2023-12-05 21:05:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:30,801 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:30,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:30,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:30,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:30,804 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1571 out of 1849 [2023-12-05 21:05:30,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1464 places, 1537 transitions, 4722 flow. Second operand has 3 states, 3 states have (on average 1572.6666666666667) internal successors, (4718), 3 states have internal predecessors, (4718), 0 states have call successors, (0), 0 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,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:30,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1571 of 1849 [2023-12-05 21:05:30,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:32,418 INFO L124 PetriNetUnfolderBase]: 152/1762 cut-off events. [2023-12-05 21:05:32,418 INFO L125 PetriNetUnfolderBase]: For 9884/9884 co-relation queries the response was YES. [2023-12-05 21:05:32,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 1762 events. 152/1762 cut-off events. For 9884/9884 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7038 event pairs, 0 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 2636. Up to 78 conditions per place. [2023-12-05 21:05:32,550 INFO L140 encePairwiseOnDemand]: 1847/1849 looper letters, 42 selfloop transitions, 1 changer transitions 0/1536 dead transitions. [2023-12-05 21:05:32,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1465 places, 1536 transitions, 4804 flow [2023-12-05 21:05:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4757 transitions. [2023-12-05 21:05:32,553 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8575806742383271 [2023-12-05 21:05:32,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4757 transitions. [2023-12-05 21:05:32,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4757 transitions. [2023-12-05 21:05:32,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:32,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4757 transitions. [2023-12-05 21:05:32,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1585.6666666666667) internal successors, (4757), 3 states have internal predecessors, (4757), 0 states have call successors, (0), 0 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:32,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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:32,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1849.0) internal successors, (7396), 4 states have internal predecessors, (7396), 0 states have call successors, (0), 0 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:32,559 INFO L308 CegarLoopForPetriNet]: 1583 programPoint places, -118 predicate places. [2023-12-05 21:05:32,559 INFO L500 AbstractCegarLoop]: Abstraction has has 1465 places, 1536 transitions, 4804 flow [2023-12-05 21:05:32,560 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1572.6666666666667) internal successors, (4718), 3 states have internal predecessors, (4718), 0 states have call successors, (0), 0 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:32,560 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:32,560 INFO L233 CegarLoopForPetriNet]: trace histogram [39, 39, 39, 39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:32,560 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2023-12-05 21:05:32,560 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:32,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1763907319, now seen corresponding path program 1 times [2023-12-05 21:05:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:32,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004515385] [2023-12-05 21:05:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:32,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:32,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:32,685 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:32,685 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:32,685 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:32,685 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:32,685 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2023-12-05 21:05:32,685 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:32,686 WARN L227 ceAbstractionStarter]: 38 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:32,686 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 39 thread instances. [2023-12-05 21:05:32,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:32,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1624 places, 1897 transitions, 5432 flow [2023-12-05 21:05:35,224 INFO L124 PetriNetUnfolderBase]: 391/2480 cut-off events. [2023-12-05 21:05:35,224 INFO L125 PetriNetUnfolderBase]: For 10621/10621 co-relation queries the response was YES. [2023-12-05 21:05:35,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 2480 events. 391/2480 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 10376 event pairs, 0 based on Foata normal form. 0/1969 useless extension candidates. Maximal degree in co-relation 3227. Up to 80 conditions per place. [2023-12-05 21:05:35,393 INFO L82 GeneralOperation]: Start removeDead. Operand has 1624 places, 1897 transitions, 5432 flow [2023-12-05 21:05:35,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1624 places, 1897 transitions, 5432 flow [2023-12-05 21:05:35,460 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:35,460 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:35,460 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:35,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:35,461 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:35,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:35,461 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:35,461 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:35,461 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:35,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:35,462 INFO L85 PathProgramCache]: Analyzing trace with hash 933604855, now seen corresponding path program 1 times [2023-12-05 21:05:35,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:35,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406430084] [2023-12-05 21:05:35,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:35,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:35,509 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:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:35,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406430084] [2023-12-05 21:05:35,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406430084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:35,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:35,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:35,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391655956] [2023-12-05 21:05:35,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:35,510 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:35,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:35,513 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1611 out of 1897 [2023-12-05 21:05:35,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1624 places, 1897 transitions, 5432 flow. Second operand has 3 states, 3 states have (on average 1613.0) internal successors, (4839), 3 states have internal predecessors, (4839), 0 states have call successors, (0), 0 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:35,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:35,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1611 of 1897 [2023-12-05 21:05:35,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:37,315 INFO L124 PetriNetUnfolderBase]: 156/1848 cut-off events. [2023-12-05 21:05:37,316 INFO L125 PetriNetUnfolderBase]: For 10621/10621 co-relation queries the response was YES. [2023-12-05 21:05:37,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1848 events. 156/1848 cut-off events. For 10621/10621 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7527 event pairs, 0 based on Foata normal form. 10595/12208 useless extension candidates. Maximal degree in co-relation 2727. Up to 120 conditions per place. [2023-12-05 21:05:37,445 INFO L140 encePairwiseOnDemand]: 1698/1897 looper letters, 45 selfloop transitions, 1 changer transitions 0/1577 dead transitions. [2023-12-05 21:05:37,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1502 places, 1577 transitions, 4884 flow [2023-12-05 21:05:37,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5077 transitions. [2023-12-05 21:05:37,449 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8921103496749253 [2023-12-05 21:05:37,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5077 transitions. [2023-12-05 21:05:37,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5077 transitions. [2023-12-05 21:05:37,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:37,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5077 transitions. [2023-12-05 21:05:37,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 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:37,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:37,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:37,457 INFO L308 CegarLoopForPetriNet]: 1624 programPoint places, -122 predicate places. [2023-12-05 21:05:37,457 INFO L500 AbstractCegarLoop]: Abstraction has has 1502 places, 1577 transitions, 4884 flow [2023-12-05 21:05:37,458 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1613.0) internal successors, (4839), 3 states have internal predecessors, (4839), 0 states have call successors, (0), 0 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:37,458 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:37,458 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:37,458 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2023-12-05 21:05:37,458 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:37,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:37,459 INFO L85 PathProgramCache]: Analyzing trace with hash 933604856, now seen corresponding path program 1 times [2023-12-05 21:05:37,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:37,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118523154] [2023-12-05 21:05:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:37,514 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:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118523154] [2023-12-05 21:05:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118523154] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:37,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400444023] [2023-12-05 21:05:37,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:37,515 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:37,519 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1612 out of 1897 [2023-12-05 21:05:37,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1502 places, 1577 transitions, 4884 flow. Second operand has 3 states, 3 states have (on average 1613.6666666666667) internal successors, (4841), 3 states have internal predecessors, (4841), 0 states have call successors, (0), 0 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:37,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:37,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1612 of 1897 [2023-12-05 21:05:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:39,203 INFO L124 PetriNetUnfolderBase]: 156/1808 cut-off events. [2023-12-05 21:05:39,203 INFO L125 PetriNetUnfolderBase]: For 10664/10664 co-relation queries the response was YES. [2023-12-05 21:05:39,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 1808 events. 156/1808 cut-off events. For 10664/10664 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7228 event pairs, 0 based on Foata normal form. 0/1613 useless extension candidates. Maximal degree in co-relation 2726. Up to 80 conditions per place. [2023-12-05 21:05:39,342 INFO L140 encePairwiseOnDemand]: 1895/1897 looper letters, 43 selfloop transitions, 1 changer transitions 0/1576 dead transitions. [2023-12-05 21:05:39,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1503 places, 1576 transitions, 4968 flow [2023-12-05 21:05:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4881 transitions. [2023-12-05 21:05:39,346 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8576700052714813 [2023-12-05 21:05:39,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 4881 transitions. [2023-12-05 21:05:39,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 4881 transitions. [2023-12-05 21:05:39,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:39,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 4881 transitions. [2023-12-05 21:05:39,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1627.0) internal successors, (4881), 3 states have internal predecessors, (4881), 0 states have call successors, (0), 0 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:39,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:39,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1897.0) internal successors, (7588), 4 states have internal predecessors, (7588), 0 states have call successors, (0), 0 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:39,354 INFO L308 CegarLoopForPetriNet]: 1624 programPoint places, -121 predicate places. [2023-12-05 21:05:39,354 INFO L500 AbstractCegarLoop]: Abstraction has has 1503 places, 1576 transitions, 4968 flow [2023-12-05 21:05:39,355 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1613.6666666666667) internal successors, (4841), 3 states have internal predecessors, (4841), 0 states have call successors, (0), 0 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:39,355 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:39,355 INFO L233 CegarLoopForPetriNet]: trace histogram [40, 40, 40, 40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:39,355 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2023-12-05 21:05:39,355 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:39,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1936129152, now seen corresponding path program 1 times [2023-12-05 21:05:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694928710] [2023-12-05 21:05:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:39,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:39,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:39,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:39,495 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:39,495 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:39,495 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:39,495 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:39,495 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2023-12-05 21:05:39,495 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:39,496 WARN L227 ceAbstractionStarter]: 39 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:39,496 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 40 thread instances. [2023-12-05 21:05:39,635 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:39,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1665 places, 1945 transitions, 5610 flow [2023-12-05 21:05:42,089 INFO L124 PetriNetUnfolderBase]: 401/2543 cut-off events. [2023-12-05 21:05:42,090 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2023-12-05 21:05:42,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3444 conditions, 2543 events. 401/2543 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 10633 event pairs, 0 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3331. Up to 82 conditions per place. [2023-12-05 21:05:42,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 1665 places, 1945 transitions, 5610 flow [2023-12-05 21:05:42,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1665 places, 1945 transitions, 5610 flow [2023-12-05 21:05:42,376 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:42,376 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:42,376 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:42,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:42,378 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:42,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:42,378 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:42,378 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:42,378 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:42,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash 368808656, now seen corresponding path program 1 times [2023-12-05 21:05:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478038144] [2023-12-05 21:05:42,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:42,423 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:42,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:42,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478038144] [2023-12-05 21:05:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478038144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:42,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:42,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083634634] [2023-12-05 21:05:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:42,424 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:42,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:42,427 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1652 out of 1945 [2023-12-05 21:05:42,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1665 places, 1945 transitions, 5610 flow. Second operand has 3 states, 3 states have (on average 1654.0) internal successors, (4962), 3 states have internal predecessors, (4962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:42,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:42,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1652 of 1945 [2023-12-05 21:05:42,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:44,658 INFO L124 PetriNetUnfolderBase]: 160/1895 cut-off events. [2023-12-05 21:05:44,658 INFO L125 PetriNetUnfolderBase]: For 11440/11440 co-relation queries the response was YES. [2023-12-05 21:05:44,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1895 events. 160/1895 cut-off events. For 11440/11440 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7711 event pairs, 0 based on Foata normal form. 11166/12820 useless extension candidates. Maximal degree in co-relation 2818. Up to 123 conditions per place. [2023-12-05 21:05:44,796 INFO L140 encePairwiseOnDemand]: 1741/1945 looper letters, 46 selfloop transitions, 1 changer transitions 0/1617 dead transitions. [2023-12-05 21:05:44,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1540 places, 1617 transitions, 5048 flow [2023-12-05 21:05:44,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5206 transitions. [2023-12-05 21:05:44,800 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8922022279348758 [2023-12-05 21:05:44,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5206 transitions. [2023-12-05 21:05:44,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5206 transitions. [2023-12-05 21:05:44,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:44,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5206 transitions. [2023-12-05 21:05:44,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1735.3333333333333) internal successors, (5206), 3 states have internal predecessors, (5206), 0 states have call successors, (0), 0 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:44,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:44,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:44,807 INFO L308 CegarLoopForPetriNet]: 1665 programPoint places, -125 predicate places. [2023-12-05 21:05:44,807 INFO L500 AbstractCegarLoop]: Abstraction has has 1540 places, 1617 transitions, 5048 flow [2023-12-05 21:05:44,807 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1654.0) internal successors, (4962), 3 states have internal predecessors, (4962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:44,807 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:44,807 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:44,808 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2023-12-05 21:05:44,808 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:44,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash 368808657, now seen corresponding path program 1 times [2023-12-05 21:05:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710436144] [2023-12-05 21:05:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:44,864 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:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:44,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710436144] [2023-12-05 21:05:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710436144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:44,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:44,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:44,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143334213] [2023-12-05 21:05:44,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:44,864 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:44,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:44,868 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1653 out of 1945 [2023-12-05 21:05:44,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1540 places, 1617 transitions, 5048 flow. Second operand has 3 states, 3 states have (on average 1654.6666666666667) internal successors, (4964), 3 states have internal predecessors, (4964), 0 states have call successors, (0), 0 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:44,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:44,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1653 of 1945 [2023-12-05 21:05:44,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:46,690 INFO L124 PetriNetUnfolderBase]: 160/1854 cut-off events. [2023-12-05 21:05:46,690 INFO L125 PetriNetUnfolderBase]: For 11484/11484 co-relation queries the response was YES. [2023-12-05 21:05:46,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2928 conditions, 1854 events. 160/1854 cut-off events. For 11484/11484 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7411 event pairs, 0 based on Foata normal form. 0/1654 useless extension candidates. Maximal degree in co-relation 2817. Up to 82 conditions per place. [2023-12-05 21:05:46,814 INFO L140 encePairwiseOnDemand]: 1943/1945 looper letters, 44 selfloop transitions, 1 changer transitions 0/1616 dead transitions. [2023-12-05 21:05:46,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1541 places, 1616 transitions, 5134 flow [2023-12-05 21:05:46,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5005 transitions. [2023-12-05 21:05:46,817 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8577549271636675 [2023-12-05 21:05:46,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5005 transitions. [2023-12-05 21:05:46,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5005 transitions. [2023-12-05 21:05:46,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:46,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5005 transitions. [2023-12-05 21:05:46,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1668.3333333333333) internal successors, (5005), 3 states have internal predecessors, (5005), 0 states have call successors, (0), 0 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:46,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:46,823 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1945.0) internal successors, (7780), 4 states have internal predecessors, (7780), 0 states have call successors, (0), 0 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:46,824 INFO L308 CegarLoopForPetriNet]: 1665 programPoint places, -124 predicate places. [2023-12-05 21:05:46,824 INFO L500 AbstractCegarLoop]: Abstraction has has 1541 places, 1616 transitions, 5134 flow [2023-12-05 21:05:46,824 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1654.6666666666667) internal successors, (4964), 3 states have internal predecessors, (4964), 0 states have call successors, (0), 0 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:46,824 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:46,824 INFO L233 CegarLoopForPetriNet]: trace histogram [41, 41, 41, 41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:46,824 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2023-12-05 21:05:46,824 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:46,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash -538846220, now seen corresponding path program 1 times [2023-12-05 21:05:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:46,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597043516] [2023-12-05 21:05:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:46,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:46,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:46,971 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:46,972 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:46,972 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:46,972 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:46,972 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2023-12-05 21:05:46,972 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:46,972 WARN L227 ceAbstractionStarter]: 40 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:46,972 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 41 thread instances. [2023-12-05 21:05:47,115 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:47,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1706 places, 1993 transitions, 5790 flow [2023-12-05 21:05:49,644 INFO L124 PetriNetUnfolderBase]: 411/2606 cut-off events. [2023-12-05 21:05:49,644 INFO L125 PetriNetUnfolderBase]: For 12300/12300 co-relation queries the response was YES. [2023-12-05 21:05:49,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 2606 events. 411/2606 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 10917 event pairs, 0 based on Foata normal form. 0/2069 useless extension candidates. Maximal degree in co-relation 3436. Up to 84 conditions per place. [2023-12-05 21:05:49,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 1706 places, 1993 transitions, 5790 flow [2023-12-05 21:05:49,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1706 places, 1993 transitions, 5790 flow [2023-12-05 21:05:49,940 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:49,941 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:49,941 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:49,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:49,942 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:49,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:49,942 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:49,942 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:49,942 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:49,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1572099033, now seen corresponding path program 1 times [2023-12-05 21:05:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:49,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888181881] [2023-12-05 21:05:49,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:49,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:50,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:05:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888181881] [2023-12-05 21:05:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888181881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:50,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:50,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67238467] [2023-12-05 21:05:50,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:50,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:50,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:50,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:50,214 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1693 out of 1993 [2023-12-05 21:05:50,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1706 places, 1993 transitions, 5790 flow. Second operand has 3 states, 3 states have (on average 1695.0) internal successors, (5085), 3 states have internal predecessors, (5085), 0 states have call successors, (0), 0 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:50,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:50,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1693 of 1993 [2023-12-05 21:05:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:52,335 INFO L124 PetriNetUnfolderBase]: 164/1942 cut-off events. [2023-12-05 21:05:52,335 INFO L125 PetriNetUnfolderBase]: For 12300/12300 co-relation queries the response was YES. [2023-12-05 21:05:52,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 1942 events. 164/1942 cut-off events. For 12300/12300 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7854 event pairs, 0 based on Foata normal form. 11752/13447 useless extension candidates. Maximal degree in co-relation 2910. Up to 126 conditions per place. [2023-12-05 21:05:52,480 INFO L140 encePairwiseOnDemand]: 1784/1993 looper letters, 47 selfloop transitions, 1 changer transitions 0/1657 dead transitions. [2023-12-05 21:05:52,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1578 places, 1657 transitions, 5214 flow [2023-12-05 21:05:52,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5335 transitions. [2023-12-05 21:05:52,483 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8922896805485867 [2023-12-05 21:05:52,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5335 transitions. [2023-12-05 21:05:52,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5335 transitions. [2023-12-05 21:05:52,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:52,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5335 transitions. [2023-12-05 21:05:52,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1778.3333333333333) internal successors, (5335), 3 states have internal predecessors, (5335), 0 states have call successors, (0), 0 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:52,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:52,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:52,490 INFO L308 CegarLoopForPetriNet]: 1706 programPoint places, -128 predicate places. [2023-12-05 21:05:52,490 INFO L500 AbstractCegarLoop]: Abstraction has has 1578 places, 1657 transitions, 5214 flow [2023-12-05 21:05:52,491 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1695.0) internal successors, (5085), 3 states have internal predecessors, (5085), 0 states have call successors, (0), 0 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:52,491 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:52,491 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:52,491 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2023-12-05 21:05:52,491 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:52,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1572099034, now seen corresponding path program 1 times [2023-12-05 21:05:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179255143] [2023-12-05 21:05:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:52,541 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:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179255143] [2023-12-05 21:05:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179255143] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802804587] [2023-12-05 21:05:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:52,542 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:52,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:52,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:52,545 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1694 out of 1993 [2023-12-05 21:05:52,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1578 places, 1657 transitions, 5214 flow. Second operand has 3 states, 3 states have (on average 1695.6666666666667) internal successors, (5087), 3 states have internal predecessors, (5087), 0 states have call successors, (0), 0 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:52,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:52,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1694 of 1993 [2023-12-05 21:05:52,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:54,514 INFO L124 PetriNetUnfolderBase]: 164/1900 cut-off events. [2023-12-05 21:05:54,514 INFO L125 PetriNetUnfolderBase]: For 12345/12345 co-relation queries the response was YES. [2023-12-05 21:05:54,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1900 events. 164/1900 cut-off events. For 12345/12345 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7596 event pairs, 0 based on Foata normal form. 0/1695 useless extension candidates. Maximal degree in co-relation 2909. Up to 84 conditions per place. [2023-12-05 21:05:54,670 INFO L140 encePairwiseOnDemand]: 1991/1993 looper letters, 45 selfloop transitions, 1 changer transitions 0/1656 dead transitions. [2023-12-05 21:05:54,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1579 places, 1656 transitions, 5302 flow [2023-12-05 21:05:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5129 transitions. [2023-12-05 21:05:54,673 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8578357584880415 [2023-12-05 21:05:54,673 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5129 transitions. [2023-12-05 21:05:54,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5129 transitions. [2023-12-05 21:05:54,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:54,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5129 transitions. [2023-12-05 21:05:54,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1709.6666666666667) internal successors, (5129), 3 states have internal predecessors, (5129), 0 states have call successors, (0), 0 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:54,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:54,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1993.0) internal successors, (7972), 4 states have internal predecessors, (7972), 0 states have call successors, (0), 0 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:54,680 INFO L308 CegarLoopForPetriNet]: 1706 programPoint places, -127 predicate places. [2023-12-05 21:05:54,680 INFO L500 AbstractCegarLoop]: Abstraction has has 1579 places, 1656 transitions, 5302 flow [2023-12-05 21:05:54,680 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1695.6666666666667) internal successors, (5087), 3 states have internal predecessors, (5087), 0 states have call successors, (0), 0 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:54,680 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:54,681 INFO L233 CegarLoopForPetriNet]: trace histogram [42, 42, 42, 42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:54,681 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2023-12-05 21:05:54,681 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:54,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -136090143, now seen corresponding path program 1 times [2023-12-05 21:05:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260802622] [2023-12-05 21:05:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:54,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:54,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:54,821 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:54,821 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:54,821 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:54,822 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:54,822 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2023-12-05 21:05:54,822 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:54,822 WARN L227 ceAbstractionStarter]: 41 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:54,822 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 42 thread instances. [2023-12-05 21:05:55,116 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:55,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1747 places, 2041 transitions, 5972 flow [2023-12-05 21:05:57,890 INFO L124 PetriNetUnfolderBase]: 421/2669 cut-off events. [2023-12-05 21:05:57,890 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2023-12-05 21:05:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 2669 events. 421/2669 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 11159 event pairs, 0 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3542. Up to 86 conditions per place. [2023-12-05 21:05:58,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 1747 places, 2041 transitions, 5972 flow [2023-12-05 21:05:58,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1747 places, 2041 transitions, 5972 flow [2023-12-05 21:05:58,174 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:58,174 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:58,174 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:58,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:58,175 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:05:58,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:58,175 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,175 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,175 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 248508690, now seen corresponding path program 1 times [2023-12-05 21:05:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068924339] [2023-12-05 21:05:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,223 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:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068924339] [2023-12-05 21:05:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068924339] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256033084] [2023-12-05 21:05:58,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,223 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,227 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1734 out of 2041 [2023-12-05 21:05:58,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1747 places, 2041 transitions, 5972 flow. Second operand has 3 states, 3 states have (on average 1736.0) internal successors, (5208), 3 states have internal predecessors, (5208), 0 states have call successors, (0), 0 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:58,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1734 of 2041 [2023-12-05 21:05:58,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:00,370 INFO L124 PetriNetUnfolderBase]: 168/1989 cut-off events. [2023-12-05 21:06:00,371 INFO L125 PetriNetUnfolderBase]: For 13202/13202 co-relation queries the response was YES. [2023-12-05 21:06:00,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1989 events. 168/1989 cut-off events. For 13202/13202 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8109 event pairs, 0 based on Foata normal form. 12353/14089 useless extension candidates. Maximal degree in co-relation 3003. Up to 129 conditions per place. [2023-12-05 21:06:00,526 INFO L140 encePairwiseOnDemand]: 1827/2041 looper letters, 48 selfloop transitions, 1 changer transitions 0/1697 dead transitions. [2023-12-05 21:06:00,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1616 places, 1697 transitions, 5382 flow [2023-12-05 21:06:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5464 transitions. [2023-12-05 21:06:00,530 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8923730197615548 [2023-12-05 21:06:00,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5464 transitions. [2023-12-05 21:06:00,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5464 transitions. [2023-12-05 21:06:00,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:00,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5464 transitions. [2023-12-05 21:06:00,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1821.3333333333333) internal successors, (5464), 3 states have internal predecessors, (5464), 0 states have call successors, (0), 0 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:00,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:00,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:00,537 INFO L308 CegarLoopForPetriNet]: 1747 programPoint places, -131 predicate places. [2023-12-05 21:06:00,537 INFO L500 AbstractCegarLoop]: Abstraction has has 1616 places, 1697 transitions, 5382 flow [2023-12-05 21:06:00,537 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1736.0) internal successors, (5208), 3 states have internal predecessors, (5208), 0 states have call successors, (0), 0 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:00,538 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:00,538 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:00,538 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2023-12-05 21:06:00,538 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:00,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:00,538 INFO L85 PathProgramCache]: Analyzing trace with hash 248508691, now seen corresponding path program 1 times [2023-12-05 21:06:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:00,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586636385] [2023-12-05 21:06:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:00,590 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:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586636385] [2023-12-05 21:06:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586636385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:00,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448490955] [2023-12-05 21:06:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:00,591 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:00,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:00,594 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1735 out of 2041 [2023-12-05 21:06:00,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1616 places, 1697 transitions, 5382 flow. Second operand has 3 states, 3 states have (on average 1736.6666666666667) internal successors, (5210), 3 states have internal predecessors, (5210), 0 states have call successors, (0), 0 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:00,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:00,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1735 of 2041 [2023-12-05 21:06:00,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:02,705 INFO L124 PetriNetUnfolderBase]: 168/1946 cut-off events. [2023-12-05 21:06:02,706 INFO L125 PetriNetUnfolderBase]: For 13248/13248 co-relation queries the response was YES. [2023-12-05 21:06:02,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1946 events. 168/1946 cut-off events. For 13248/13248 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7786 event pairs, 0 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 3002. Up to 86 conditions per place. [2023-12-05 21:06:02,844 INFO L140 encePairwiseOnDemand]: 2039/2041 looper letters, 46 selfloop transitions, 1 changer transitions 0/1696 dead transitions. [2023-12-05 21:06:02,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1617 places, 1696 transitions, 5472 flow [2023-12-05 21:06:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5253 transitions. [2023-12-05 21:06:02,847 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8579127878490935 [2023-12-05 21:06:02,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5253 transitions. [2023-12-05 21:06:02,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5253 transitions. [2023-12-05 21:06:02,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:02,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5253 transitions. [2023-12-05 21:06:02,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1751.0) internal successors, (5253), 3 states have internal predecessors, (5253), 0 states have call successors, (0), 0 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:02,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:02,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2041.0) internal successors, (8164), 4 states have internal predecessors, (8164), 0 states have call successors, (0), 0 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:02,855 INFO L308 CegarLoopForPetriNet]: 1747 programPoint places, -130 predicate places. [2023-12-05 21:06:02,855 INFO L500 AbstractCegarLoop]: Abstraction has has 1617 places, 1696 transitions, 5472 flow [2023-12-05 21:06:02,855 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1736.6666666666667) internal successors, (5210), 3 states have internal predecessors, (5210), 0 states have call successors, (0), 0 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:02,855 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:02,855 INFO L233 CegarLoopForPetriNet]: trace histogram [43, 43, 43, 43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,855 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2023-12-05 21:06:02,856 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:02,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1604996081, now seen corresponding path program 1 times [2023-12-05 21:06:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:02,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147090855] [2023-12-05 21:06:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:02,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:02,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:02,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:02,998 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:02,998 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:02,998 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:02,998 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:02,998 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2023-12-05 21:06:02,998 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:02,998 WARN L227 ceAbstractionStarter]: 42 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:02,998 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 43 thread instances. [2023-12-05 21:06:03,145 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:03,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1788 places, 2089 transitions, 6156 flow [2023-12-05 21:06:06,116 INFO L124 PetriNetUnfolderBase]: 431/2732 cut-off events. [2023-12-05 21:06:06,117 INFO L125 PetriNetUnfolderBase]: For 14147/14147 co-relation queries the response was YES. [2023-12-05 21:06:06,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3765 conditions, 2732 events. 431/2732 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 11420 event pairs, 0 based on Foata normal form. 0/2169 useless extension candidates. Maximal degree in co-relation 3649. Up to 88 conditions per place. [2023-12-05 21:06:06,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 1788 places, 2089 transitions, 6156 flow [2023-12-05 21:06:06,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1788 places, 2089 transitions, 6156 flow [2023-12-05 21:06:06,427 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:06,427 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:06,427 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:06,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:06,428 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:06:06,428 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:06,428 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:06,428 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:06,428 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:06,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 693004923, now seen corresponding path program 1 times [2023-12-05 21:06:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947865469] [2023-12-05 21:06:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:06,476 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:06,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:06,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947865469] [2023-12-05 21:06:06,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947865469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:06,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301278207] [2023-12-05 21:06:06,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:06,477 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:06,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:06,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:06,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:06,480 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1775 out of 2089 [2023-12-05 21:06:06,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1788 places, 2089 transitions, 6156 flow. Second operand has 3 states, 3 states have (on average 1777.0) internal successors, (5331), 3 states have internal predecessors, (5331), 0 states have call successors, (0), 0 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:06,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:06,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1775 of 2089 [2023-12-05 21:06:06,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:08,869 INFO L124 PetriNetUnfolderBase]: 172/2036 cut-off events. [2023-12-05 21:06:08,869 INFO L125 PetriNetUnfolderBase]: For 14147/14147 co-relation queries the response was YES. [2023-12-05 21:06:09,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 2036 events. 172/2036 cut-off events. For 14147/14147 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 8248 event pairs, 0 based on Foata normal form. 12969/14746 useless extension candidates. Maximal degree in co-relation 3097. Up to 132 conditions per place. [2023-12-05 21:06:09,028 INFO L140 encePairwiseOnDemand]: 1870/2089 looper letters, 49 selfloop transitions, 1 changer transitions 0/1737 dead transitions. [2023-12-05 21:06:09,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1654 places, 1737 transitions, 5552 flow [2023-12-05 21:06:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5593 transitions. [2023-12-05 21:06:09,031 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8924525291207914 [2023-12-05 21:06:09,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5593 transitions. [2023-12-05 21:06:09,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5593 transitions. [2023-12-05 21:06:09,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:09,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5593 transitions. [2023-12-05 21:06:09,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1864.3333333333333) internal successors, (5593), 3 states have internal predecessors, (5593), 0 states have call successors, (0), 0 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:09,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:09,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:09,040 INFO L308 CegarLoopForPetriNet]: 1788 programPoint places, -134 predicate places. [2023-12-05 21:06:09,040 INFO L500 AbstractCegarLoop]: Abstraction has has 1654 places, 1737 transitions, 5552 flow [2023-12-05 21:06:09,041 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1777.0) internal successors, (5331), 3 states have internal predecessors, (5331), 0 states have call successors, (0), 0 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:09,041 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:09,041 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:09,042 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2023-12-05 21:06:09,042 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:09,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:09,043 INFO L85 PathProgramCache]: Analyzing trace with hash 693004924, now seen corresponding path program 1 times [2023-12-05 21:06:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735812589] [2023-12-05 21:06:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:09,135 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:09,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:09,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735812589] [2023-12-05 21:06:09,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735812589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:09,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:09,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408902742] [2023-12-05 21:06:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:09,144 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:09,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:09,152 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1776 out of 2089 [2023-12-05 21:06:09,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1654 places, 1737 transitions, 5552 flow. Second operand has 3 states, 3 states have (on average 1777.6666666666667) internal successors, (5333), 3 states have internal predecessors, (5333), 0 states have call successors, (0), 0 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:09,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:09,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1776 of 2089 [2023-12-05 21:06:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:11,401 INFO L124 PetriNetUnfolderBase]: 172/1992 cut-off events. [2023-12-05 21:06:11,402 INFO L125 PetriNetUnfolderBase]: For 14194/14194 co-relation queries the response was YES. [2023-12-05 21:06:11,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 1992 events. 172/1992 cut-off events. For 14194/14194 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 7972 event pairs, 0 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 3096. Up to 88 conditions per place. [2023-12-05 21:06:11,549 INFO L140 encePairwiseOnDemand]: 2087/2089 looper letters, 47 selfloop transitions, 1 changer transitions 0/1736 dead transitions. [2023-12-05 21:06:11,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1655 places, 1736 transitions, 5644 flow [2023-12-05 21:06:11,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5377 transitions. [2023-12-05 21:06:11,556 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8579862773256741 [2023-12-05 21:06:11,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 5377 transitions. [2023-12-05 21:06:11,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 5377 transitions. [2023-12-05 21:06:11,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:11,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 5377 transitions. [2023-12-05 21:06:11,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 1792.3333333333333) internal successors, (5377), 3 states have internal predecessors, (5377), 0 states have call successors, (0), 0 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:11,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:11,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 2089.0) internal successors, (8356), 4 states have internal predecessors, (8356), 0 states have call successors, (0), 0 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:11,570 INFO L308 CegarLoopForPetriNet]: 1788 programPoint places, -133 predicate places. [2023-12-05 21:06:11,570 INFO L500 AbstractCegarLoop]: Abstraction has has 1655 places, 1736 transitions, 5644 flow [2023-12-05 21:06:11,571 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1777.6666666666667) internal successors, (5333), 3 states have internal predecessors, (5333), 0 states have call successors, (0), 0 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:11,571 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:11,571 INFO L233 CegarLoopForPetriNet]: trace histogram [44, 44, 44, 44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,572 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2023-12-05 21:06:11,572 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:11,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1315525118, now seen corresponding path program 1 times [2023-12-05 21:06:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:11,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445277356] [2023-12-05 21:06:11,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:11,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:11,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:11,816 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:11,816 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:11,816 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:11,816 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:11,816 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2023-12-05 21:06:11,816 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:11,818 WARN L227 ceAbstractionStarter]: 43 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:11,818 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 44 thread instances. [2023-12-05 21:06:11,966 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:11,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1829 places, 2137 transitions, 6342 flow [2023-12-05 21:06:15,141 INFO L124 PetriNetUnfolderBase]: 441/2795 cut-off events. [2023-12-05 21:06:15,142 INFO L125 PetriNetUnfolderBase]: For 15136/15136 co-relation queries the response was YES. [2023-12-05 21:06:15,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 2795 events. 441/2795 cut-off events. For 15136/15136 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 11720 event pairs, 0 based on Foata normal form. 0/2219 useless extension candidates. Maximal degree in co-relation 3757. Up to 90 conditions per place. [2023-12-05 21:06:15,365 INFO L82 GeneralOperation]: Start removeDead. Operand has 1829 places, 2137 transitions, 6342 flow [2023-12-05 21:06:15,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1829 places, 2137 transitions, 6342 flow [2023-12-05 21:06:15,451 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:15,451 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;@41253ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:15,451 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:15,452 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:15,453 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-12-05 21:06:15,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:15,453 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:15,453 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:15,453 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:15,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1389379564, now seen corresponding path program 1 times [2023-12-05 21:06:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:15,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695683119] [2023-12-05 21:06:15,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:15,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:15,613 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:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:15,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695683119] [2023-12-05 21:06:15,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695683119] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:15,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:15,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:15,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806642250] [2023-12-05 21:06:15,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:15,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:15,618 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 1816 out of 2137 [2023-12-05 21:06:15,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1829 places, 2137 transitions, 6342 flow. Second operand has 3 states, 3 states have (on average 1818.0) internal successors, (5454), 3 states have internal predecessors, (5454), 0 states have call successors, (0), 0 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:15,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:15,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1816 of 2137 [2023-12-05 21:06:15,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand