/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/25_stack_longer-1-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:02:39,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:02:39,960 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:02:39,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:02:39,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:02:39,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:02:39,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:02:39,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:02:39,987 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:02:39,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:02:39,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:02:39,991 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:02:39,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:02:39,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:02:39,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:02:39,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:02:39,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:02:39,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:02:39,993 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:02:39,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:02:39,993 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:02:39,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:02:39,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:02:39,994 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:02:39,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:02:39,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:02:39,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:02:39,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:02:39,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:02:39,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:02:39,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:02:39,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:02:39,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:02:39,997 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:02:40,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:02:40,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:02:40,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:02:40,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:02:40,197 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:02:40,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/25_stack_longer-1-pthread.i [2023-12-05 21:02:41,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:02:41,461 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:02:41,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/25_stack_longer-1-pthread.i [2023-12-05 21:02:41,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cb680fc/f18df8a54c114bdb93a1051de8d4e400/FLAGa97030f92 [2023-12-05 21:02:41,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13cb680fc/f18df8a54c114bdb93a1051de8d4e400 [2023-12-05 21:02:41,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:02:41,485 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:02:41,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:02:41,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:02:41,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:02:41,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4699a542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41, skipping insertion in model container [2023-12-05 21:02:41,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,519 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:02:41,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:02:41,783 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:02:41,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:02:41,864 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:02:41,865 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:02:41,870 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:02:41,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41 WrapperNode [2023-12-05 21:02:41,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:02:41,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:02:41,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:02:41,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:02:41,877 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:02:41" (1/1) ... [2023-12-05 21:02:41,887 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:02:41" (1/1) ... [2023-12-05 21:02:41,909 INFO L138 Inliner]: procedures = 172, calls = 39, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 138 [2023-12-05 21:02:41,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:02:41,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:02:41,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:02:41,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:02:41,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:02:41,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:02:41,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:02:41,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:02:41,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (1/1) ... [2023-12-05 21:02:41,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:02:41,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:02:41,954 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:02:41,983 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:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:02:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:02:41,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:02:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:02:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:02:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:02:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:02:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:02:41,991 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:02:42,104 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:02:42,106 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:02:42,266 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:02:42,311 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:02:42,312 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 21:02:42,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:02:42 BoogieIcfgContainer [2023-12-05 21:02:42,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:02:42,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:02:42,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:02:42,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:02:42,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:02:41" (1/3) ... [2023-12-05 21:02:42,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c829030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:02:42, skipping insertion in model container [2023-12-05 21:02:42,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:41" (2/3) ... [2023-12-05 21:02:42,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c829030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:02:42, skipping insertion in model container [2023-12-05 21:02:42,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:02:42" (3/3) ... [2023-12-05 21:02:42,318 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longer-1-pthread.i [2023-12-05 21:02:42,350 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:02:42,350 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:02:42,350 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:02:42,394 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:42,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 242 flow [2023-12-05 21:02:42,482 INFO L124 PetriNetUnfolderBase]: 8/132 cut-off events. [2023-12-05 21:02:42,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:42,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 132 events. 8/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-12-05 21:02:42,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 119 transitions, 242 flow [2023-12-05 21:02:42,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 119 transitions, 242 flow [2023-12-05 21:02:42,507 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:42,512 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;@568caffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:42,512 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-05 21:02:42,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:42,518 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-12-05 21:02:42,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:42,518 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:42,518 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:42,519 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-05 21:02:42,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash 389655535, now seen corresponding path program 1 times [2023-12-05 21:02:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:42,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390753292] [2023-12-05 21:02:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:42,794 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:02:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:42,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390753292] [2023-12-05 21:02:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390753292] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457039499] [2023-12-05 21:02:42,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:42,802 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:42,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:42,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:42,843 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 119 [2023-12-05 21:02:42,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:42,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:42,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 119 [2023-12-05 21:02:42,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:42,936 INFO L124 PetriNetUnfolderBase]: 26/269 cut-off events. [2023-12-05 21:02:42,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 269 events. 26/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 836 event pairs, 14 based on Foata normal form. 12/253 useless extension candidates. Maximal degree in co-relation 275. Up to 44 conditions per place. [2023-12-05 21:02:42,939 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 17 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2023-12-05 21:02:42,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 256 flow [2023-12-05 21:02:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-12-05 21:02:42,955 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.84593837535014 [2023-12-05 21:02:42,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-12-05 21:02:42,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-12-05 21:02:42,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:42,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-12-05 21:02:42,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:42,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:42,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:42,974 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, -6 predicate places. [2023-12-05 21:02:42,974 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 256 flow [2023-12-05 21:02:42,974 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:42,975 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:42,975 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:42,975 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:02:42,976 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-05 21:02:42,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash 389655536, now seen corresponding path program 1 times [2023-12-05 21:02:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:42,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130458342] [2023-12-05 21:02:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:42,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:43,119 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:02:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130458342] [2023-12-05 21:02:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130458342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494774381] [2023-12-05 21:02:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:43,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:43,123 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2023-12-05 21:02:43,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:43,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2023-12-05 21:02:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:43,171 INFO L124 PetriNetUnfolderBase]: 15/189 cut-off events. [2023-12-05 21:02:43,172 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2023-12-05 21:02:43,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 189 events. 15/189 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 375 event pairs, 7 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 204. Up to 27 conditions per place. [2023-12-05 21:02:43,177 INFO L140 encePairwiseOnDemand]: 117/119 looper letters, 15 selfloop transitions, 1 changer transitions 0/107 dead transitions. [2023-12-05 21:02:43,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 107 transitions, 284 flow [2023-12-05 21:02:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-12-05 21:02:43,180 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8375350140056023 [2023-12-05 21:02:43,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-12-05 21:02:43,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-12-05 21:02:43,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:43,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-12-05 21:02:43,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,183 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,185 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2023-12-05 21:02:43,185 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 284 flow [2023-12-05 21:02:43,185 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,185 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:43,186 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:43,186 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:02:43,186 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-05 21:02:43,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1142889730, now seen corresponding path program 1 times [2023-12-05 21:02:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778702792] [2023-12-05 21:02:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:43,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:43,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:43,260 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:43,261 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-12-05 21:02:43,263 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (5 of 7 remaining) [2023-12-05 21:02:43,264 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (4 of 7 remaining) [2023-12-05 21:02:43,264 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2023-12-05 21:02:43,264 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2023-12-05 21:02:43,265 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (1 of 7 remaining) [2023-12-05 21:02:43,267 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 7 remaining) [2023-12-05 21:02:43,267 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:02:43,268 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:43,270 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:43,270 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:02:43,333 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:43,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 195 transitions, 400 flow [2023-12-05 21:02:43,367 INFO L124 PetriNetUnfolderBase]: 15/223 cut-off events. [2023-12-05 21:02:43,371 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:02:43,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 223 events. 15/223 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 165. Up to 6 conditions per place. [2023-12-05 21:02:43,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 195 transitions, 400 flow [2023-12-05 21:02:43,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 195 transitions, 400 flow [2023-12-05 21:02:43,377 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:43,381 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;@568caffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:43,382 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-12-05 21:02:43,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:43,407 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-12-05 21:02:43,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:43,407 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:43,407 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:43,408 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:02:43,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:43,408 INFO L85 PathProgramCache]: Analyzing trace with hash 208882450, now seen corresponding path program 1 times [2023-12-05 21:02:43,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206800482] [2023-12-05 21:02:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:43,486 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:02:43,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:43,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206800482] [2023-12-05 21:02:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206800482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:43,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:43,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:43,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692997735] [2023-12-05 21:02:43,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:43,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:43,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:43,490 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 195 [2023-12-05 21:02:43,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:43,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 195 [2023-12-05 21:02:43,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:43,799 INFO L124 PetriNetUnfolderBase]: 475/2620 cut-off events. [2023-12-05 21:02:43,800 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-12-05 21:02:43,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2620 events. 475/2620 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 21312 event pairs, 331 based on Foata normal form. 154/2466 useless extension candidates. Maximal degree in co-relation 718. Up to 628 conditions per place. [2023-12-05 21:02:43,821 INFO L140 encePairwiseOnDemand]: 187/195 looper letters, 26 selfloop transitions, 1 changer transitions 0/181 dead transitions. [2023-12-05 21:02:43,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 181 transitions, 426 flow [2023-12-05 21:02:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-12-05 21:02:43,824 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8683760683760684 [2023-12-05 21:02:43,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-12-05 21:02:43,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-12-05 21:02:43,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:43,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-12-05 21:02:43,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,829 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -7 predicate places. [2023-12-05 21:02:43,829 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 181 transitions, 426 flow [2023-12-05 21:02:43,829 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,829 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:43,830 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:43,830 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:02:43,830 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:02:43,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash 208882451, now seen corresponding path program 1 times [2023-12-05 21:02:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:43,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719222919] [2023-12-05 21:02:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:43,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:43,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719222919] [2023-12-05 21:02:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719222919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499992744] [2023-12-05 21:02:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:43,904 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:43,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:43,906 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 195 [2023-12-05 21:02:43,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:43,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:43,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 195 [2023-12-05 21:02:43,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:44,229 INFO L124 PetriNetUnfolderBase]: 293/1757 cut-off events. [2023-12-05 21:02:44,229 INFO L125 PetriNetUnfolderBase]: For 233/405 co-relation queries the response was YES. [2023-12-05 21:02:44,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 1757 events. 293/1757 cut-off events. For 233/405 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12752 event pairs, 197 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 576. Up to 395 conditions per place. [2023-12-05 21:02:44,240 INFO L140 encePairwiseOnDemand]: 193/195 looper letters, 24 selfloop transitions, 1 changer transitions 0/180 dead transitions. [2023-12-05 21:02:44,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 180 transitions, 472 flow [2023-12-05 21:02:44,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-12-05 21:02:44,242 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8598290598290599 [2023-12-05 21:02:44,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-12-05 21:02:44,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-12-05 21:02:44,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:44,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-12-05 21:02:44,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:44,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:44,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:44,247 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -6 predicate places. [2023-12-05 21:02:44,247 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 180 transitions, 472 flow [2023-12-05 21:02:44,247 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:44,247 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:44,248 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:44,248 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:02:44,251 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:02:44,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1861547134, now seen corresponding path program 1 times [2023-12-05 21:02:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:44,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174663834] [2023-12-05 21:02:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:44,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:44,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:44,291 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:44,291 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (7 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (6 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (3 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (2 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (1 of 9 remaining) [2023-12-05 21:02:44,294 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 9 remaining) [2023-12-05 21:02:44,295 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:02:44,296 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:44,296 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:44,296 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:02:44,354 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:44,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 271 transitions, 560 flow [2023-12-05 21:02:44,388 INFO L124 PetriNetUnfolderBase]: 22/314 cut-off events. [2023-12-05 21:02:44,388 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:02:44,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 314 events. 22/314 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 858 event pairs, 0 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 240. Up to 8 conditions per place. [2023-12-05 21:02:44,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 271 transitions, 560 flow [2023-12-05 21:02:44,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 271 transitions, 560 flow [2023-12-05 21:02:44,395 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:44,396 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;@568caffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:44,396 INFO L363 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-12-05 21:02:44,399 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:44,399 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-12-05 21:02:44,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:44,399 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:44,399 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:44,399 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-12-05 21:02:44,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash 948800513, now seen corresponding path program 1 times [2023-12-05 21:02:44,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643216173] [2023-12-05 21:02:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:44,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:44,428 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:02:44,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:44,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643216173] [2023-12-05 21:02:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643216173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:44,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23745309] [2023-12-05 21:02:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:44,429 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:44,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:44,430 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 271 [2023-12-05 21:02:44,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 271 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:44,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:44,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 271 [2023-12-05 21:02:44,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:48,011 INFO L124 PetriNetUnfolderBase]: 6460/25723 cut-off events. [2023-12-05 21:02:48,012 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2023-12-05 21:02:48,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33876 conditions, 25723 events. 6460/25723 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 317472 event pairs, 4912 based on Foata normal form. 1874/24739 useless extension candidates. Maximal degree in co-relation 3271. Up to 7828 conditions per place. [2023-12-05 21:02:48,245 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 35 selfloop transitions, 1 changer transitions 0/254 dead transitions. [2023-12-05 21:02:48,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 254 transitions, 598 flow [2023-12-05 21:02:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2023-12-05 21:02:48,247 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8782287822878229 [2023-12-05 21:02:48,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 714 transitions. [2023-12-05 21:02:48,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 714 transitions. [2023-12-05 21:02:48,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:48,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 714 transitions. [2023-12-05 21:02:48,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:48,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:48,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:48,251 INFO L308 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2023-12-05 21:02:48,252 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 254 transitions, 598 flow [2023-12-05 21:02:48,252 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:48,252 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:48,252 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:48,252 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:02:48,252 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-12-05 21:02:48,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash 948800514, now seen corresponding path program 1 times [2023-12-05 21:02:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:48,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113601341] [2023-12-05 21:02:48,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:48,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113601341] [2023-12-05 21:02:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113601341] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845005404] [2023-12-05 21:02:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:48,300 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:48,301 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 271 [2023-12-05 21:02:48,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 254 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:48,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:48,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 271 [2023-12-05 21:02:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:50,318 INFO L124 PetriNetUnfolderBase]: 4091/17165 cut-off events. [2023-12-05 21:02:50,319 INFO L125 PetriNetUnfolderBase]: For 2507/4683 co-relation queries the response was YES. [2023-12-05 21:02:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27502 conditions, 17165 events. 4091/17165 cut-off events. For 2507/4683 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 199894 event pairs, 3059 based on Foata normal form. 0/15688 useless extension candidates. Maximal degree in co-relation 2575. Up to 5003 conditions per place. [2023-12-05 21:02:50,556 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 33 selfloop transitions, 1 changer transitions 0/253 dead transitions. [2023-12-05 21:02:50,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 253 transitions, 662 flow [2023-12-05 21:02:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2023-12-05 21:02:50,558 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8696186961869619 [2023-12-05 21:02:50,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 707 transitions. [2023-12-05 21:02:50,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions. [2023-12-05 21:02:50,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:50,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions. [2023-12-05 21:02:50,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:50,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:50,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:50,562 INFO L308 CegarLoopForPetriNet]: 259 programPoint places, -7 predicate places. [2023-12-05 21:02:50,562 INFO L500 AbstractCegarLoop]: Abstraction has has 252 places, 253 transitions, 662 flow [2023-12-05 21:02:50,563 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:50,563 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:50,563 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:50,563 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:02:50,563 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-12-05 21:02:50,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash -356960241, now seen corresponding path program 1 times [2023-12-05 21:02:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:50,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593477077] [2023-12-05 21:02:50,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:50,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:50,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:50,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:50,602 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:50,602 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (9 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (8 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (5 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (4 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (3 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (2 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (1 of 11 remaining) [2023-12-05 21:02:50,603 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 11 remaining) [2023-12-05 21:02:50,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:02:50,604 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:50,604 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:50,604 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:02:50,655 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 347 transitions, 722 flow [2023-12-05 21:02:50,701 INFO L124 PetriNetUnfolderBase]: 29/405 cut-off events. [2023-12-05 21:02:50,702 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:02:50,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 405 events. 29/405 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1332 event pairs, 0 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 322. Up to 10 conditions per place. [2023-12-05 21:02:50,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 347 transitions, 722 flow [2023-12-05 21:02:50,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 347 transitions, 722 flow [2023-12-05 21:02:50,714 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:50,715 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;@568caffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:50,715 INFO L363 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-05 21:02:50,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:50,716 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-12-05 21:02:50,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:50,716 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:50,717 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:50,717 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-05 21:02:50,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1685557572, now seen corresponding path program 1 times [2023-12-05 21:02:50,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:50,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295397249] [2023-12-05 21:02:50,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:50,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:50,779 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:02:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295397249] [2023-12-05 21:02:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295397249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:50,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414816361] [2023-12-05 21:02:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:50,780 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:50,781 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 347 [2023-12-05 21:02:50,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 347 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:50,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:50,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 347 [2023-12-05 21:02:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:03:33,495 INFO L124 PetriNetUnfolderBase]: 77821/251146 cut-off events. [2023-12-05 21:03:33,495 INFO L125 PetriNetUnfolderBase]: For 10957/10957 co-relation queries the response was YES. [2023-12-05 21:03:36,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344836 conditions, 251146 events. 77821/251146 cut-off events. For 10957/10957 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 3966700 event pairs, 61693 based on Foata normal form. 21232/246565 useless extension candidates. Maximal degree in co-relation 33920. Up to 90124 conditions per place. [2023-12-05 21:03:38,762 INFO L140 encePairwiseOnDemand]: 335/347 looper letters, 44 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2023-12-05 21:03:38,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 327 transitions, 772 flow [2023-12-05 21:03:38,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:03:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:03:38,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2023-12-05 21:03:38,764 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8837656099903939 [2023-12-05 21:03:38,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2023-12-05 21:03:38,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2023-12-05 21:03:38,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:03:38,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2023-12-05 21:03:38,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:38,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:38,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:38,769 INFO L308 CegarLoopForPetriNet]: 331 programPoint places, -9 predicate places. [2023-12-05 21:03:38,769 INFO L500 AbstractCegarLoop]: Abstraction has has 322 places, 327 transitions, 772 flow [2023-12-05 21:03:38,770 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:38,770 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:38,770 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:38,770 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:03:38,770 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-05 21:03:38,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1685557571, now seen corresponding path program 1 times [2023-12-05 21:03:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:38,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315564570] [2023-12-05 21:03:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:38,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:03:38,808 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:03:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:03:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315564570] [2023-12-05 21:03:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315564570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:03:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:03:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:03:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984755802] [2023-12-05 21:03:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:03:38,809 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:03:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:03:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:03:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:03:38,811 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 347 [2023-12-05 21:03:38,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 327 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:38,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:03:38,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 347 [2023-12-05 21:03:38,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand