/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/31_simple_loop5_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:04:17,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:04:17,463 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:17,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:04:17,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:04:17,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:04:17,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:04:17,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:04:17,492 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:04:17,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:04:17,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:04:17,493 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:04:17,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:04:17,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:04:17,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:04:17,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:04:17,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:04:17,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:04:17,495 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:04:17,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:04:17,495 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:04:17,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:04:17,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:04:17,499 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:04:17,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:04:17,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:17,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:04:17,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:04:17,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:04:17,502 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:04:17,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:04:17,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:04:17,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:04:17,502 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:17,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:04:17,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:04:17,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:04:17,738 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:04:17,738 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:04:17,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i [2023-12-05 21:04:18,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:04:19,115 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:04:19,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs.i [2023-12-05 21:04:19,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8798ae534/de8850df81834df9b592b1af8b63b182/FLAG3bccf421b [2023-12-05 21:04:19,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8798ae534/de8850df81834df9b592b1af8b63b182 [2023-12-05 21:04:19,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:04:19,141 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:04:19,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:19,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:04:19,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:04:19,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:19" (1/1) ... [2023-12-05 21:04:19,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37280768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:19, skipping insertion in model container [2023-12-05 21:04:19,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:19" (1/1) ... [2023-12-05 21:04:19,180 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:04:19,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:19,430 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:04:19,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:19,518 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:04:19,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:19 WrapperNode [2023-12-05 21:04:19,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:19,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:19,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:04:19,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:04:19,527 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:19" (1/1) ... [2023-12-05 21:04:19,549 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:19" (1/1) ... [2023-12-05 21:04:19,565 INFO L138 Inliner]: procedures = 170, calls = 19, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 85 [2023-12-05 21:04:19,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:19,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:04:19,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:04:19,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:04:19,575 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:19" (1/1) ... [2023-12-05 21:04:19,576 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:19" (1/1) ... [2023-12-05 21:04:19,580 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:19" (1/1) ... [2023-12-05 21:04:19,581 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:19" (1/1) ... [2023-12-05 21:04:19,591 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:19" (1/1) ... [2023-12-05 21:04:19,594 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:19" (1/1) ... [2023-12-05 21:04:19,595 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:19" (1/1) ... [2023-12-05 21:04:19,596 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:19" (1/1) ... [2023-12-05 21:04:19,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:04:19,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:04:19,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:04:19,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:04:19,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:19" (1/1) ... [2023-12-05 21:04:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:19,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:04:19,682 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:19,751 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:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-12-05 21:04:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-12-05 21:04:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:04:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:04:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:04:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:04:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:04:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:04:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:04:19,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:04:19,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:04:19,779 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:19,908 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:04:19,911 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:04:20,036 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:04:20,072 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:04:20,072 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-05 21:04:20,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:20 BoogieIcfgContainer [2023-12-05 21:04:20,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:04:20,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:04:20,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:04:20,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:04:20,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:04:19" (1/3) ... [2023-12-05 21:04:20,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fdbb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:20, skipping insertion in model container [2023-12-05 21:04:20,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:19" (2/3) ... [2023-12-05 21:04:20,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fdbb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:20, skipping insertion in model container [2023-12-05 21:04:20,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:20" (3/3) ... [2023-12-05 21:04:20,081 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2023-12-05 21:04:20,094 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:04:20,094 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:04:20,094 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:04:20,181 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:20,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 69 transitions, 146 flow [2023-12-05 21:04:20,247 INFO L124 PetriNetUnfolderBase]: 8/81 cut-off events. [2023-12-05 21:04:20,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:20,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 8/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 63. Up to 4 conditions per place. [2023-12-05 21:04:20,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 69 transitions, 146 flow [2023-12-05 21:04:20,265 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 68 transitions, 143 flow [2023-12-05 21:04:20,273 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:20,281 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:20,281 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:20,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:20,286 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:20,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:20,286 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:20,286 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:20,287 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:20,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash 797419310, now seen corresponding path program 1 times [2023-12-05 21:04:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:20,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593657889] [2023-12-05 21:04:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:20,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:20,462 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,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:20,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593657889] [2023-12-05 21:04:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593657889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:20,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:20,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685397111] [2023-12-05 21:04:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:20,469 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:20,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:20,494 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2023-12-05 21:04:20,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (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,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:20,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2023-12-05 21:04:20,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:20,567 INFO L124 PetriNetUnfolderBase]: 44/181 cut-off events. [2023-12-05 21:04:20,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:20,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 181 events. 44/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 613 event pairs, 24 based on Foata normal form. 64/229 useless extension candidates. Maximal degree in co-relation 243. Up to 79 conditions per place. [2023-12-05 21:04:20,570 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 14 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-12-05 21:04:20,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 46 transitions, 129 flow [2023-12-05 21:04:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-12-05 21:04:20,581 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7004830917874396 [2023-12-05 21:04:20,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-12-05 21:04:20,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-12-05 21:04:20,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:20,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-12-05 21:04:20,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (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,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (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,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (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,602 INFO L308 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2023-12-05 21:04:20,602 INFO L500 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 129 flow [2023-12-05 21:04:20,603 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (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,603 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:20,603 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:20,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:04:20,603 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash 797419311, now seen corresponding path program 1 times [2023-12-05 21:04:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370958878] [2023-12-05 21:04:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:20,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:20,721 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,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:20,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370958878] [2023-12-05 21:04:20,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370958878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:20,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:20,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:20,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816008675] [2023-12-05 21:04:20,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:20,723 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:20,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:20,724 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 69 [2023-12-05 21:04:20,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (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,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:20,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 69 [2023-12-05 21:04:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:20,756 INFO L124 PetriNetUnfolderBase]: 27/131 cut-off events. [2023-12-05 21:04:20,756 INFO L125 PetriNetUnfolderBase]: For 30/38 co-relation queries the response was YES. [2023-12-05 21:04:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 131 events. 27/131 cut-off events. For 30/38 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 341 event pairs, 14 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 211. Up to 49 conditions per place. [2023-12-05 21:04:20,758 INFO L140 encePairwiseOnDemand]: 66/69 looper letters, 11 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-12-05 21:04:20,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 44 transitions, 145 flow [2023-12-05 21:04:20,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2023-12-05 21:04:20,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6618357487922706 [2023-12-05 21:04:20,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 137 transitions. [2023-12-05 21:04:20,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 137 transitions. [2023-12-05 21:04:20,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:20,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 137 transitions. [2023-12-05 21:04:20,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (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,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (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,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L308 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2023-12-05 21:04:20,762 INFO L500 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 145 flow [2023-12-05 21:04:20,762 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (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,762 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:20,762 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:20,762 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:04:20,763 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:20,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash -428096656, now seen corresponding path program 1 times [2023-12-05 21:04:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987577255] [2023-12-05 21:04:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:20,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:20,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:20,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:20,832 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:20,833 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:20,837 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:20,837 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:20,838 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:20,838 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:20,839 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:20,839 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:04:20,839 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:20,842 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:20,842 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:04:20,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:20,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 100 transitions, 220 flow [2023-12-05 21:04:20,887 INFO L124 PetriNetUnfolderBase]: 11/109 cut-off events. [2023-12-05 21:04:20,887 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:20,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 109 events. 11/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 228 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2023-12-05 21:04:20,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 100 transitions, 220 flow [2023-12-05 21:04:20,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 81 transitions, 175 flow [2023-12-05 21:04:20,890 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:20,891 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:20,891 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:20,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:20,893 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:20,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:20,893 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:20,893 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:20,894 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:20,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:20,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1094499438, now seen corresponding path program 1 times [2023-12-05 21:04:20,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:20,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153037739] [2023-12-05 21:04:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:20,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:20,927 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,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:20,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153037739] [2023-12-05 21:04:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153037739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:20,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104283348] [2023-12-05 21:04:20,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:20,928 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:20,929 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 100 [2023-12-05 21:04:20,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (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,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:20,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 100 [2023-12-05 21:04:20,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:21,038 INFO L124 PetriNetUnfolderBase]: 233/637 cut-off events. [2023-12-05 21:04:21,038 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-12-05 21:04:21,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 637 events. 233/637 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3286 event pairs, 138 based on Foata normal form. 271/862 useless extension candidates. Maximal degree in co-relation 987. Up to 340 conditions per place. [2023-12-05 21:04:21,046 INFO L140 encePairwiseOnDemand]: 87/100 looper letters, 17 selfloop transitions, 1 changer transitions 0/55 dead transitions. [2023-12-05 21:04:21,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 159 flow [2023-12-05 21:04:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2023-12-05 21:04:21,051 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-12-05 21:04:21,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 204 transitions. [2023-12-05 21:04:21,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 204 transitions. [2023-12-05 21:04:21,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:21,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 204 transitions. [2023-12-05 21:04:21,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (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,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (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,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (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,057 INFO L308 CegarLoopForPetriNet]: 80 programPoint places, -18 predicate places. [2023-12-05 21:04:21,057 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 159 flow [2023-12-05 21:04:21,057 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (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,057 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,058 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,058 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:04:21,058 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:21,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1094499437, now seen corresponding path program 1 times [2023-12-05 21:04:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858961213] [2023-12-05 21:04:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:21,153 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,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858961213] [2023-12-05 21:04:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858961213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:21,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:21,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454768142] [2023-12-05 21:04:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:21,154 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:21,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:21,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:21,156 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 100 [2023-12-05 21:04:21,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (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,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:21,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 100 [2023-12-05 21:04:21,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:21,212 INFO L124 PetriNetUnfolderBase]: 144/443 cut-off events. [2023-12-05 21:04:21,212 INFO L125 PetriNetUnfolderBase]: For 117/149 co-relation queries the response was YES. [2023-12-05 21:04:21,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 443 events. 144/443 cut-off events. For 117/149 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2044 event pairs, 83 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 874. Up to 211 conditions per place. [2023-12-05 21:04:21,215 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 14 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-12-05 21:04:21,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 181 flow [2023-12-05 21:04:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2023-12-05 21:04:21,217 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2023-12-05 21:04:21,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 194 transitions. [2023-12-05 21:04:21,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 194 transitions. [2023-12-05 21:04:21,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:21,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 194 transitions. [2023-12-05 21:04:21,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (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,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (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,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (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,221 INFO L308 CegarLoopForPetriNet]: 80 programPoint places, -18 predicate places. [2023-12-05 21:04:21,221 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 181 flow [2023-12-05 21:04:21,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (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,221 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,222 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,222 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:04:21,222 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:21,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1153832587, now seen corresponding path program 1 times [2023-12-05 21:04:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291322949] [2023-12-05 21:04:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:21,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:21,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:21,277 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:21,277 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:21,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:21,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:21,277 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:21,278 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:21,278 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:21,278 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:04:21,278 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:21,279 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:21,279 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:04:21,314 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:21,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 131 transitions, 298 flow [2023-12-05 21:04:21,335 INFO L124 PetriNetUnfolderBase]: 14/137 cut-off events. [2023-12-05 21:04:21,335 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:21,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 137 events. 14/137 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2023-12-05 21:04:21,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 131 transitions, 298 flow [2023-12-05 21:04:21,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 94 transitions, 209 flow [2023-12-05 21:04:21,342 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:21,345 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:21,345 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:21,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:21,348 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:21,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:21,348 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,348 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,348 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:21,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 850903317, now seen corresponding path program 1 times [2023-12-05 21:04:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210001004] [2023-12-05 21:04:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:21,399 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,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210001004] [2023-12-05 21:04:21,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210001004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:21,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:21,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157427323] [2023-12-05 21:04:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:21,400 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:21,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:21,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:21,404 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 131 [2023-12-05 21:04:21,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 94 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (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,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:21,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 131 [2023-12-05 21:04:21,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:21,588 INFO L124 PetriNetUnfolderBase]: 1016/2221 cut-off events. [2023-12-05 21:04:21,588 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-12-05 21:04:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3713 conditions, 2221 events. 1016/2221 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14375 event pairs, 624 based on Foata normal form. 1036/3121 useless extension candidates. Maximal degree in co-relation 3678. Up to 1339 conditions per place. [2023-12-05 21:04:21,601 INFO L140 encePairwiseOnDemand]: 116/131 looper letters, 20 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-12-05 21:04:21,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 191 flow [2023-12-05 21:04:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:21,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-12-05 21:04:21,603 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6692111959287532 [2023-12-05 21:04:21,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-12-05 21:04:21,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-12-05 21:04:21,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:21,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-12-05 21:04:21,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (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,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (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,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (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,607 INFO L308 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2023-12-05 21:04:21,607 INFO L500 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 191 flow [2023-12-05 21:04:21,607 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (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,607 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,607 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,607 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:04:21,607 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:21,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,608 INFO L85 PathProgramCache]: Analyzing trace with hash 850903318, now seen corresponding path program 1 times [2023-12-05 21:04:21,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167294499] [2023-12-05 21:04:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:21,657 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,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167294499] [2023-12-05 21:04:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167294499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335111203] [2023-12-05 21:04:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:21,662 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:21,664 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 131 [2023-12-05 21:04:21,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (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,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:21,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 131 [2023-12-05 21:04:21,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:21,838 INFO L124 PetriNetUnfolderBase]: 630/1514 cut-off events. [2023-12-05 21:04:21,838 INFO L125 PetriNetUnfolderBase]: For 495/599 co-relation queries the response was YES. [2023-12-05 21:04:21,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 1514 events. 630/1514 cut-off events. For 495/599 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9310 event pairs, 380 based on Foata normal form. 0/1460 useless extension candidates. Maximal degree in co-relation 3295. Up to 832 conditions per place. [2023-12-05 21:04:21,846 INFO L140 encePairwiseOnDemand]: 128/131 looper letters, 17 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-12-05 21:04:21,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 219 flow [2023-12-05 21:04:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2023-12-05 21:04:21,847 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.638676844783715 [2023-12-05 21:04:21,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 251 transitions. [2023-12-05 21:04:21,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 251 transitions. [2023-12-05 21:04:21,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:21,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 251 transitions. [2023-12-05 21:04:21,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (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,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (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,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (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,850 INFO L308 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2023-12-05 21:04:21,850 INFO L500 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 219 flow [2023-12-05 21:04:21,850 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (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,851 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,851 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:04:21,851 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:21,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1929776663, now seen corresponding path program 1 times [2023-12-05 21:04:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063689029] [2023-12-05 21:04:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:21,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:21,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:21,885 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:21,886 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:21,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:21,886 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:21,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:21,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:21,887 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:21,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:04:21,887 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:21,888 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:21,888 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:04:21,921 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:21,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 162 transitions, 380 flow [2023-12-05 21:04:21,934 INFO L124 PetriNetUnfolderBase]: 17/165 cut-off events. [2023-12-05 21:04:21,934 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:04:21,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 165 events. 17/165 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 386 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 181. Up to 10 conditions per place. [2023-12-05 21:04:21,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 162 transitions, 380 flow [2023-12-05 21:04:21,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 107 transitions, 245 flow [2023-12-05 21:04:21,937 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:21,937 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:21,938 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:21,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:21,939 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:21,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:21,939 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:21,939 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:21,939 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:21,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1956307017, now seen corresponding path program 1 times [2023-12-05 21:04:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:21,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082757561] [2023-12-05 21:04:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:21,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:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082757561] [2023-12-05 21:04:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082757561] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933762880] [2023-12-05 21:04:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:21,974 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:21,975 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 162 [2023-12-05 21:04:21,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 245 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:21,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:21,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 162 [2023-12-05 21:04:21,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:22,775 INFO L124 PetriNetUnfolderBase]: 4013/7621 cut-off events. [2023-12-05 21:04:22,775 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2023-12-05 21:04:22,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13164 conditions, 7621 events. 4013/7621 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 56040 event pairs, 2514 based on Foata normal form. 3763/10978 useless extension candidates. Maximal degree in co-relation 13128. Up to 4984 conditions per place. [2023-12-05 21:04:22,827 INFO L140 encePairwiseOnDemand]: 145/162 looper letters, 23 selfloop transitions, 1 changer transitions 0/73 dead transitions. [2023-12-05 21:04:22,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 73 transitions, 225 flow [2023-12-05 21:04:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-12-05 21:04:22,829 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6625514403292181 [2023-12-05 21:04:22,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-12-05 21:04:22,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-12-05 21:04:22,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:22,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-12-05 21:04:22,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (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,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (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,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (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,832 INFO L308 CegarLoopForPetriNet]: 106 programPoint places, -24 predicate places. [2023-12-05 21:04:22,832 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 225 flow [2023-12-05 21:04:22,832 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:22,832 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:22,832 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:22,832 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:04:22,832 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:22,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1956307016, now seen corresponding path program 1 times [2023-12-05 21:04:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981981320] [2023-12-05 21:04:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:22,871 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,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981981320] [2023-12-05 21:04:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981981320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:22,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:22,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:22,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550154821] [2023-12-05 21:04:22,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:22,872 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:22,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:22,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:22,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:22,873 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 162 [2023-12-05 21:04:22,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 225 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:22,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:22,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 162 [2023-12-05 21:04:22,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:23,368 INFO L124 PetriNetUnfolderBase]: 2493/5132 cut-off events. [2023-12-05 21:04:23,368 INFO L125 PetriNetUnfolderBase]: For 2115/2435 co-relation queries the response was YES. [2023-12-05 21:04:23,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11895 conditions, 5132 events. 2493/5132 cut-off events. For 2115/2435 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 37198 event pairs, 1541 based on Foata normal form. 0/4970 useless extension candidates. Maximal degree in co-relation 11854. Up to 3100 conditions per place. [2023-12-05 21:04:23,407 INFO L140 encePairwiseOnDemand]: 159/162 looper letters, 20 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2023-12-05 21:04:23,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 259 flow [2023-12-05 21:04:23,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-12-05 21:04:23,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6337448559670782 [2023-12-05 21:04:23,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-12-05 21:04:23,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-12-05 21:04:23,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:23,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-12-05 21:04:23,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (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,412 INFO L308 CegarLoopForPetriNet]: 106 programPoint places, -24 predicate places. [2023-12-05 21:04:23,412 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 259 flow [2023-12-05 21:04:23,412 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:23,412 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:23,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:23,412 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:04:23,412 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:23,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2019308017, now seen corresponding path program 1 times [2023-12-05 21:04:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503816135] [2023-12-05 21:04:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:23,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:23,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:23,437 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:23,437 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:23,438 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:23,438 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:23,438 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:23,438 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:23,438 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:23,438 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:04:23,438 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:23,439 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:23,439 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:04:23,467 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:23,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 193 transitions, 466 flow [2023-12-05 21:04:23,482 INFO L124 PetriNetUnfolderBase]: 20/193 cut-off events. [2023-12-05 21:04:23,482 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:04:23,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 193 events. 20/193 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 464 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 215. Up to 12 conditions per place. [2023-12-05 21:04:23,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 193 transitions, 466 flow [2023-12-05 21:04:23,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 120 transitions, 283 flow [2023-12-05 21:04:23,485 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:23,485 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:23,485 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:23,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:23,486 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:23,486 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:23,486 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:23,486 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:23,486 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:23,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash -926195848, now seen corresponding path program 1 times [2023-12-05 21:04:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:23,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336580384] [2023-12-05 21:04:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:23,505 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,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336580384] [2023-12-05 21:04:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336580384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:23,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:23,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138102490] [2023-12-05 21:04:23,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:23,506 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:23,507 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 193 [2023-12-05 21:04:23,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (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,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:23,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 193 [2023-12-05 21:04:23,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:26,100 INFO L124 PetriNetUnfolderBase]: 14948/25765 cut-off events. [2023-12-05 21:04:26,101 INFO L125 PetriNetUnfolderBase]: For 6530/6530 co-relation queries the response was YES. [2023-12-05 21:04:26,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45646 conditions, 25765 events. 14948/25765 cut-off events. For 6530/6530 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 205988 event pairs, 9480 based on Foata normal form. 13240/37789 useless extension candidates. Maximal degree in co-relation 45609. Up to 17863 conditions per place. [2023-12-05 21:04:26,354 INFO L140 encePairwiseOnDemand]: 174/193 looper letters, 26 selfloop transitions, 1 changer transitions 0/82 dead transitions. [2023-12-05 21:04:26,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 82 transitions, 261 flow [2023-12-05 21:04:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-12-05 21:04:26,355 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6580310880829016 [2023-12-05 21:04:26,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-12-05 21:04:26,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-12-05 21:04:26,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:26,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-12-05 21:04:26,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (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,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (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,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (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,359 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, -27 predicate places. [2023-12-05 21:04:26,359 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 261 flow [2023-12-05 21:04:26,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (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,359 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:26,359 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:26,359 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:04:26,359 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:26,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash -926195847, now seen corresponding path program 1 times [2023-12-05 21:04:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490835100] [2023-12-05 21:04:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:26,394 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,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:26,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490835100] [2023-12-05 21:04:26,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490835100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:26,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:26,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693585395] [2023-12-05 21:04:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:26,395 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:26,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:26,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:26,396 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 193 [2023-12-05 21:04:26,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (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,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:26,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 193 [2023-12-05 21:04:26,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:28,093 INFO L124 PetriNetUnfolderBase]: 9297/17201 cut-off events. [2023-12-05 21:04:28,093 INFO L125 PetriNetUnfolderBase]: For 8838/9806 co-relation queries the response was YES. [2023-12-05 21:04:28,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41461 conditions, 17201 events. 9297/17201 cut-off events. For 8838/9806 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 138818 event pairs, 5834 based on Foata normal form. 0/16715 useless extension candidates. Maximal degree in co-relation 41419. Up to 11119 conditions per place. [2023-12-05 21:04:28,245 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 23 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2023-12-05 21:04:28,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 80 transitions, 301 flow [2023-12-05 21:04:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-12-05 21:04:28,246 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6303972366148531 [2023-12-05 21:04:28,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-12-05 21:04:28,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-12-05 21:04:28,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:28,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-12-05 21:04:28,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:28,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (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,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (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,250 INFO L308 CegarLoopForPetriNet]: 119 programPoint places, -27 predicate places. [2023-12-05 21:04:28,250 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 301 flow [2023-12-05 21:04:28,250 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (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,250 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:28,250 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:28,250 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:04:28,250 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:28,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 648380322, now seen corresponding path program 1 times [2023-12-05 21:04:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:28,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924015215] [2023-12-05 21:04:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:28,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:28,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:28,274 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:28,274 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:28,274 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:28,274 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:28,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:28,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:28,275 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:28,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:04:28,275 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:28,275 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:28,275 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:04:28,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:28,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 224 transitions, 556 flow [2023-12-05 21:04:28,320 INFO L124 PetriNetUnfolderBase]: 23/221 cut-off events. [2023-12-05 21:04:28,320 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:04:28,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 221 events. 23/221 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 516 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 250. Up to 14 conditions per place. [2023-12-05 21:04:28,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 224 transitions, 556 flow [2023-12-05 21:04:28,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 133 transitions, 323 flow [2023-12-05 21:04:28,322 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:28,322 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:28,323 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:28,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:28,323 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:28,323 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:28,323 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:28,323 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:28,324 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:28,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash -353730472, now seen corresponding path program 1 times [2023-12-05 21:04:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381122638] [2023-12-05 21:04:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:28,345 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,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:28,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381122638] [2023-12-05 21:04:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381122638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:28,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:28,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697061663] [2023-12-05 21:04:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:28,347 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:28,348 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 224 [2023-12-05 21:04:28,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 133 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (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,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:28,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 224 [2023-12-05 21:04:28,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:38,084 INFO L124 PetriNetUnfolderBase]: 53585/86029 cut-off events. [2023-12-05 21:04:38,085 INFO L125 PetriNetUnfolderBase]: For 28886/28886 co-relation queries the response was YES. [2023-12-05 21:04:38,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155483 conditions, 86029 events. 53585/86029 cut-off events. For 28886/28886 co-relation queries the response was YES. Maximal size of possible extension queue 2480. Compared 728476 event pairs, 34266 based on Foata normal form. 45559/127942 useless extension candidates. Maximal degree in co-relation 155445. Up to 62332 conditions per place. [2023-12-05 21:04:38,991 INFO L140 encePairwiseOnDemand]: 203/224 looper letters, 29 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-12-05 21:04:38,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 91 transitions, 299 flow [2023-12-05 21:04:38,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-12-05 21:04:38,993 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2023-12-05 21:04:38,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-12-05 21:04:38,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-12-05 21:04:38,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:38,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-12-05 21:04:38,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:38,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:38,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:38,996 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, -30 predicate places. [2023-12-05 21:04:38,996 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 91 transitions, 299 flow [2023-12-05 21:04:38,996 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:38,996 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:38,996 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:38,996 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:04:38,996 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:38,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash -353730471, now seen corresponding path program 1 times [2023-12-05 21:04:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131177596] [2023-12-05 21:04:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:39,025 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,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131177596] [2023-12-05 21:04:39,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131177596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:39,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:39,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:39,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121581867] [2023-12-05 21:04:39,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:39,026 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:39,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:39,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:39,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:39,027 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 224 [2023-12-05 21:04:39,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 91 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (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,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:39,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 224 [2023-12-05 21:04:39,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:45,219 INFO L124 PetriNetUnfolderBase]: 33354/57053 cut-off events. [2023-12-05 21:04:45,219 INFO L125 PetriNetUnfolderBase]: For 35811/38723 co-relation queries the response was YES. [2023-12-05 21:04:45,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141821 conditions, 57053 events. 33354/57053 cut-off events. For 35811/38723 co-relation queries the response was YES. Maximal size of possible extension queue 1693. Compared 497369 event pairs, 21143 based on Foata normal form. 0/55595 useless extension candidates. Maximal degree in co-relation 141778. Up to 38821 conditions per place. [2023-12-05 21:04:45,976 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 26 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:04:45,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 89 transitions, 345 flow [2023-12-05 21:04:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-12-05 21:04:45,978 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6279761904761905 [2023-12-05 21:04:45,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-12-05 21:04:45,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-12-05 21:04:45,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:45,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-12-05 21:04:45,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (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,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (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,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (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,981 INFO L308 CegarLoopForPetriNet]: 132 programPoint places, -30 predicate places. [2023-12-05 21:04:45,981 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 345 flow [2023-12-05 21:04:45,981 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (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,981 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:45,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:45,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:04:45,981 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:45,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -862614637, now seen corresponding path program 1 times [2023-12-05 21:04:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681045566] [2023-12-05 21:04:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:45,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:46,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:46,009 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:46,010 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:46,010 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:46,010 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:46,010 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:46,010 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:46,010 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:46,010 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:04:46,010 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:46,011 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:46,011 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-05 21:04:46,041 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:46,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 255 transitions, 650 flow [2023-12-05 21:04:46,061 INFO L124 PetriNetUnfolderBase]: 26/249 cut-off events. [2023-12-05 21:04:46,061 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:04:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 249 events. 26/249 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 587 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 286. Up to 16 conditions per place. [2023-12-05 21:04:46,063 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 255 transitions, 650 flow [2023-12-05 21:04:46,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 146 transitions, 365 flow [2023-12-05 21:04:46,065 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:46,065 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;@2798469d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:46,065 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:46,066 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:46,066 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-12-05 21:04:46,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:46,066 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:46,066 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:46,066 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:46,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash -238910889, now seen corresponding path program 1 times [2023-12-05 21:04:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936907991] [2023-12-05 21:04:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:46,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:46,089 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,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936907991] [2023-12-05 21:04:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936907991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:46,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051116099] [2023-12-05 21:04:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:46,090 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:46,091 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 255 [2023-12-05 21:04:46,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 146 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (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,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:46,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 255 [2023-12-05 21:04:46,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:25,637 INFO L124 PetriNetUnfolderBase]: 186992/284317 cut-off events. [2023-12-05 21:05:25,637 INFO L125 PetriNetUnfolderBase]: For 120011/120011 co-relation queries the response was YES. [2023-12-05 21:05:28,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522171 conditions, 284317 events. 186992/284317 cut-off events. For 120011/120011 co-relation queries the response was YES. Maximal size of possible extension queue 7059. Compared 2520382 event pairs, 120288 based on Foata normal form. 154180/427561 useless extension candidates. Maximal degree in co-relation 522132. Up to 213235 conditions per place. [2023-12-05 21:05:30,758 INFO L140 encePairwiseOnDemand]: 232/255 looper letters, 32 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2023-12-05 21:05:30,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 100 transitions, 339 flow [2023-12-05 21:05:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:30,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:30,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-12-05 21:05:30,761 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6522875816993464 [2023-12-05 21:05:30,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-12-05 21:05:30,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-12-05 21:05:30,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:30,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-12-05 21:05:30,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call 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,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call 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,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call 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,793 INFO L308 CegarLoopForPetriNet]: 145 programPoint places, -33 predicate places. [2023-12-05 21:05:30,793 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 100 transitions, 339 flow [2023-12-05 21:05:30,794 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call 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,794 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:30,794 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:30,794 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:05:30,794 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:05:30,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -238910888, now seen corresponding path program 1 times [2023-12-05 21:05:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945639666] [2023-12-05 21:05:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:30,827 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,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945639666] [2023-12-05 21:05:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945639666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:30,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:30,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24715440] [2023-12-05 21:05:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:30,828 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:30,829 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 255 [2023-12-05 21:05:30,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 100 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call 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,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:30,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 255 [2023-12-05 21:05:30,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand