/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/goblint-regression/28-race_reach_42-trylock2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:47,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:47,602 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:16:47,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:47,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:47,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:47,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:47,636 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:47,636 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:47,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:47,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:47,641 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:47,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:47,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:47,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:47,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:47,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:47,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:47,643 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:47,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:47,644 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:47,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:47,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:47,645 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:47,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:47,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:47,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:47,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:47,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:47,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:47,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:47,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:47,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:47,648 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:16:47,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:47,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:47,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:47,916 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:47,917 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:47,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_42-trylock2_racefree.i [2023-12-05 21:16:49,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:16:49,413 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:16:49,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_42-trylock2_racefree.i [2023-12-05 21:16:49,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4d2cca8/6eac11ad1a2743c0b8182c4dfd761d80/FLAGd1c493c61 [2023-12-05 21:16:49,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd4d2cca8/6eac11ad1a2743c0b8182c4dfd761d80 [2023-12-05 21:16:49,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:16:49,439 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:16:49,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:49,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:16:49,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:16:49,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:49,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13238435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49, skipping insertion in model container [2023-12-05 21:16:49,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:49,488 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:16:49,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:49,791 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:16:49,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:16:49,906 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:16:49,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49 WrapperNode [2023-12-05 21:16:49,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:49,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:49,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:16:49,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:16:49,914 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:16:49" (1/1) ... [2023-12-05 21:16:49,940 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:16:49" (1/1) ... [2023-12-05 21:16:49,971 INFO L138 Inliner]: procedures = 172, calls = 61, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 164 [2023-12-05 21:16:49,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:16:49,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:16:49,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:16:49,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:16:49,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:49,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:49,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:49,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:50,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:50,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:50,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:50,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:50,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:16:50,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:16:50,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:16:50,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:16:50,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (1/1) ... [2023-12-05 21:16:50,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:50,102 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:16:50,112 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:16:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:16:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:16:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:16:50,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:16:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:16:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:16:50,140 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:16:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:16:50,140 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2023-12-05 21:16:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:16:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:16:50,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:16:50,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:16:50,143 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:16:50,260 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:16:50,262 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:16:50,539 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:16:50,596 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:16:50,596 INFO L309 CfgBuilder]: Removed 23 assume(true) statements. [2023-12-05 21:16:50,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:50 BoogieIcfgContainer [2023-12-05 21:16:50,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:16:50,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:16:50,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:16:50,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:16:50,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:49" (1/3) ... [2023-12-05 21:16:50,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27417985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:50, skipping insertion in model container [2023-12-05 21:16:50,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:49" (2/3) ... [2023-12-05 21:16:50,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27417985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:16:50, skipping insertion in model container [2023-12-05 21:16:50,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:16:50" (3/3) ... [2023-12-05 21:16:50,605 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2023-12-05 21:16:50,625 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:16:50,625 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:16:50,625 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:16:50,699 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:16:50,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 227 transitions, 461 flow [2023-12-05 21:16:50,858 INFO L124 PetriNetUnfolderBase]: 53/350 cut-off events. [2023-12-05 21:16:50,859 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:16:50,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 350 events. 53/350 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1546 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 187. Up to 6 conditions per place. [2023-12-05 21:16:50,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 227 transitions, 461 flow [2023-12-05 21:16:50,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 227 transitions, 461 flow [2023-12-05 21:16:50,900 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:50,906 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;@56c53352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:50,907 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:50,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:50,919 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:16:50,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:50,919 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:50,920 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:50,921 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:50,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash 992941880, now seen corresponding path program 1 times [2023-12-05 21:16:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:50,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484855759] [2023-12-05 21:16:50,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:50,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:51,310 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:16:51,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:51,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484855759] [2023-12-05 21:16:51,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484855759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:51,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:51,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77155360] [2023-12-05 21:16:51,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:51,324 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:51,368 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 227 [2023-12-05 21:16:51,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 227 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:51,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 227 [2023-12-05 21:16:51,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:51,782 INFO L124 PetriNetUnfolderBase]: 255/1412 cut-off events. [2023-12-05 21:16:51,783 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:16:51,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 1412 events. 255/1412 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 9411 event pairs, 216 based on Foata normal form. 354/1703 useless extension candidates. Maximal degree in co-relation 1819. Up to 483 conditions per place. [2023-12-05 21:16:51,795 INFO L140 encePairwiseOnDemand]: 192/227 looper letters, 39 selfloop transitions, 1 changer transitions 32/194 dead transitions. [2023-12-05 21:16:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 194 transitions, 505 flow [2023-12-05 21:16:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2023-12-05 21:16:51,816 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7944199706314243 [2023-12-05 21:16:51,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2023-12-05 21:16:51,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2023-12-05 21:16:51,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:51,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2023-12-05 21:16:51,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,836 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, -12 predicate places. [2023-12-05 21:16:51,837 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 194 transitions, 505 flow [2023-12-05 21:16:51,837 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,837 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:51,837 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:51,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:16:51,838 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:51,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash 992941881, now seen corresponding path program 1 times [2023-12-05 21:16:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853751790] [2023-12-05 21:16:51,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:51,987 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:16:51,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:51,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853751790] [2023-12-05 21:16:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853751790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032831937] [2023-12-05 21:16:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:51,989 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:51,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:51,991 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 227 [2023-12-05 21:16:51,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 194 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:51,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:51,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 227 [2023-12-05 21:16:51,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:52,310 INFO L124 PetriNetUnfolderBase]: 325/1671 cut-off events. [2023-12-05 21:16:52,311 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2023-12-05 21:16:52,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 1671 events. 325/1671 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11380 event pairs, 12 based on Foata normal form. 0/1536 useless extension candidates. Maximal degree in co-relation 2863. Up to 580 conditions per place. [2023-12-05 21:16:52,323 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 56 selfloop transitions, 3 changer transitions 29/220 dead transitions. [2023-12-05 21:16:52,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 220 transitions, 779 flow [2023-12-05 21:16:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:16:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:16:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-12-05 21:16:52,326 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7092511013215859 [2023-12-05 21:16:52,326 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-12-05 21:16:52,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-12-05 21:16:52,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:52,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-12-05 21:16:52,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,332 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,333 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, -9 predicate places. [2023-12-05 21:16:52,333 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 220 transitions, 779 flow [2023-12-05 21:16:52,334 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:52,334 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:52,334 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:52,334 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:16:52,335 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:52,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1702513619, now seen corresponding path program 1 times [2023-12-05 21:16:52,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435284003] [2023-12-05 21:16:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:52,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:52,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435284003] [2023-12-05 21:16:52,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435284003] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:16:52,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404199787] [2023-12-05 21:16:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:52,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:52,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:16:52,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:16:52,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:16:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:52,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:16:52,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:16:52,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:16:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:52,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:16:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:16:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404199787] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:16:53,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:16:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:16:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278063569] [2023-12-05 21:16:53,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:16:53,114 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:16:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:16:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:16:53,118 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 227 [2023-12-05 21:16:53,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 220 transitions, 779 flow. Second operand has 14 states, 14 states have (on average 143.57142857142858) internal successors, (2010), 14 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:53,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 227 [2023-12-05 21:16:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:53,318 INFO L124 PetriNetUnfolderBase]: 60/328 cut-off events. [2023-12-05 21:16:53,318 INFO L125 PetriNetUnfolderBase]: For 215/245 co-relation queries the response was YES. [2023-12-05 21:16:53,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 328 events. 60/328 cut-off events. For 215/245 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1139 event pairs, 10 based on Foata normal form. 17/343 useless extension candidates. Maximal degree in co-relation 628. Up to 88 conditions per place. [2023-12-05 21:16:53,320 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 59 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-12-05 21:16:53,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 129 transitions, 634 flow [2023-12-05 21:16:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:16:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:16:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1053 transitions. [2023-12-05 21:16:53,323 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6626809314033983 [2023-12-05 21:16:53,323 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1053 transitions. [2023-12-05 21:16:53,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1053 transitions. [2023-12-05 21:16:53,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:53,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1053 transitions. [2023-12-05 21:16:53,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.42857142857142) internal successors, (1053), 7 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,331 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,332 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, -92 predicate places. [2023-12-05 21:16:53,332 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 634 flow [2023-12-05 21:16:53,334 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 143.57142857142858) internal successors, (2010), 14 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,334 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:53,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:53,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 21:16:53,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:16:53,540 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1238313948, now seen corresponding path program 1 times [2023-12-05 21:16:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020075271] [2023-12-05 21:16:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:53,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:16:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:16:53,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:16:53,605 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:16:53,607 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:16:53,608 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:16:53,609 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:16:53,609 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:16:53,609 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:16:53,609 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:16:53,610 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:16:53,612 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:16:53,612 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:16:53,656 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:16:53,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 288 transitions, 592 flow [2023-12-05 21:16:53,729 INFO L124 PetriNetUnfolderBase]: 88/562 cut-off events. [2023-12-05 21:16:53,729 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:16:53,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 562 events. 88/562 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2757 event pairs, 0 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 352. Up to 9 conditions per place. [2023-12-05 21:16:53,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 288 transitions, 592 flow [2023-12-05 21:16:53,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 288 transitions, 592 flow [2023-12-05 21:16:53,739 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:16:53,742 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;@56c53352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:16:53,742 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:16:53,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:16:53,748 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:16:53,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:16:53,748 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:53,749 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:53,749 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:53,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash 346984536, now seen corresponding path program 1 times [2023-12-05 21:16:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:53,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76645340] [2023-12-05 21:16:53,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:53,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:53,813 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:16:53,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:53,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76645340] [2023-12-05 21:16:53,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76645340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:53,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:53,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:16:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410517629] [2023-12-05 21:16:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:53,817 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:16:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:16:53,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:16:53,820 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 288 [2023-12-05 21:16:53,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 288 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:53,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:53,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 288 [2023-12-05 21:16:53,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:16:57,258 INFO L124 PetriNetUnfolderBase]: 7098/21977 cut-off events. [2023-12-05 21:16:57,258 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-12-05 21:16:57,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33256 conditions, 21977 events. 7098/21977 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 241663 event pairs, 6036 based on Foata normal form. 7136/28293 useless extension candidates. Maximal degree in co-relation 2414. Up to 9591 conditions per place. [2023-12-05 21:16:57,433 INFO L140 encePairwiseOnDemand]: 241/288 looper letters, 53 selfloop transitions, 1 changer transitions 29/255 dead transitions. [2023-12-05 21:16:57,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 255 transitions, 688 flow [2023-12-05 21:16:57,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:16:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:16:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2023-12-05 21:16:57,436 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2023-12-05 21:16:57,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 696 transitions. [2023-12-05 21:16:57,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 696 transitions. [2023-12-05 21:16:57,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:16:57,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 696 transitions. [2023-12-05 21:16:57,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:57,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:57,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 288.0) internal successors, (1152), 4 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:57,444 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, -12 predicate places. [2023-12-05 21:16:57,444 INFO L500 AbstractCegarLoop]: Abstraction has has 235 places, 255 transitions, 688 flow [2023-12-05 21:16:57,444 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:57,444 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:16:57,445 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:16:57,445 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:16:57,445 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:16:57,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:16:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 346984537, now seen corresponding path program 1 times [2023-12-05 21:16:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:16:57,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120778682] [2023-12-05 21:16:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:16:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:16:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:16:57,650 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:16:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:16:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120778682] [2023-12-05 21:16:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120778682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:16:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:16:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:16:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675549009] [2023-12-05 21:16:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:16:57,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:16:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:16:57,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:16:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:16:57,658 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 288 [2023-12-05 21:16:57,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 255 transitions, 688 flow. Second operand has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:16:57,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:16:57,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 288 [2023-12-05 21:16:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:00,924 INFO L124 PetriNetUnfolderBase]: 8860/27262 cut-off events. [2023-12-05 21:17:00,925 INFO L125 PetriNetUnfolderBase]: For 4996/4996 co-relation queries the response was YES. [2023-12-05 21:17:00,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53797 conditions, 27262 events. 8860/27262 cut-off events. For 4996/4996 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 307499 event pairs, 3636 based on Foata normal form. 0/25229 useless extension candidates. Maximal degree in co-relation 3931. Up to 12575 conditions per place. [2023-12-05 21:17:01,097 INFO L140 encePairwiseOnDemand]: 282/288 looper letters, 72 selfloop transitions, 3 changer transitions 53/295 dead transitions. [2023-12-05 21:17:01,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 295 transitions, 1094 flow [2023-12-05 21:17:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 812 transitions. [2023-12-05 21:17:01,101 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7048611111111112 [2023-12-05 21:17:01,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 812 transitions. [2023-12-05 21:17:01,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 812 transitions. [2023-12-05 21:17:01,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:01,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 812 transitions. [2023-12-05 21:17:01,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:01,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:01,106 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 288.0) internal successors, (1440), 5 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:01,108 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, -9 predicate places. [2023-12-05 21:17:01,108 INFO L500 AbstractCegarLoop]: Abstraction has has 238 places, 295 transitions, 1094 flow [2023-12-05 21:17:01,109 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:01,109 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:01,109 INFO L233 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:01,109 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:17:01,109 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:01,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash -552858766, now seen corresponding path program 1 times [2023-12-05 21:17:01,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:01,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968769364] [2023-12-05 21:17:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:01,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968769364] [2023-12-05 21:17:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968769364] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:01,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374216151] [2023-12-05 21:17:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:01,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:01,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:01,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:01,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:17:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:01,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:01,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:01,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:01,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374216151] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:01,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:17:01,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851018871] [2023-12-05 21:17:01,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:01,671 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:17:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:17:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:17:01,676 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 288 [2023-12-05 21:17:01,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 295 transitions, 1094 flow. Second operand has 14 states, 14 states have (on average 178.57142857142858) internal successors, (2500), 14 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:01,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:01,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 288 [2023-12-05 21:17:01,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:02,347 INFO L124 PetriNetUnfolderBase]: 1776/4712 cut-off events. [2023-12-05 21:17:02,347 INFO L125 PetriNetUnfolderBase]: For 3744/4174 co-relation queries the response was YES. [2023-12-05 21:17:02,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12482 conditions, 4712 events. 1776/4712 cut-off events. For 3744/4174 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 38010 event pairs, 0 based on Foata normal form. 3/4603 useless extension candidates. Maximal degree in co-relation 918. Up to 2649 conditions per place. [2023-12-05 21:17:02,375 INFO L140 encePairwiseOnDemand]: 281/288 looper letters, 146 selfloop transitions, 8 changer transitions 0/254 dead transitions. [2023-12-05 21:17:02,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 254 transitions, 1420 flow [2023-12-05 21:17:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:17:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:17:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1918 transitions. [2023-12-05 21:17:02,380 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6659722222222222 [2023-12-05 21:17:02,380 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1918 transitions. [2023-12-05 21:17:02,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1918 transitions. [2023-12-05 21:17:02,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:02,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1918 transitions. [2023-12-05 21:17:02,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 191.8) internal successors, (1918), 10 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 288.0) internal successors, (3168), 11 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,389 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 288.0) internal successors, (3168), 11 states have internal predecessors, (3168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,390 INFO L308 CegarLoopForPetriNet]: 247 programPoint places, -89 predicate places. [2023-12-05 21:17:02,390 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 254 transitions, 1420 flow [2023-12-05 21:17:02,391 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 178.57142857142858) internal successors, (2500), 14 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,391 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:02,391 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2023-12-05 21:17:02,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:17:02,597 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-05 21:17:02,599 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:02,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1146428190, now seen corresponding path program 1 times [2023-12-05 21:17:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:02,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570284281] [2023-12-05 21:17:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:02,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:17:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:02,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:17:02,643 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:17:02,643 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:17:02,644 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:17:02,646 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:17:02,646 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:17:02,646 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:17:02,646 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:17:02,646 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:17:02,648 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:17:02,648 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:17:02,684 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:17:02,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 349 transitions, 725 flow [2023-12-05 21:17:02,775 INFO L124 PetriNetUnfolderBase]: 128/813 cut-off events. [2023-12-05 21:17:02,776 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:17:02,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 813 events. 128/813 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4168 event pairs, 1 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 570. Up to 16 conditions per place. [2023-12-05 21:17:02,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 349 transitions, 725 flow [2023-12-05 21:17:02,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 349 transitions, 725 flow [2023-12-05 21:17:02,887 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:02,887 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;@56c53352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:02,888 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:02,890 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:02,890 INFO L124 PetriNetUnfolderBase]: 1/41 cut-off events. [2023-12-05 21:17:02,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:02,890 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:02,890 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:02,890 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:02,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1159909493, now seen corresponding path program 1 times [2023-12-05 21:17:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788621736] [2023-12-05 21:17:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:02,939 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:17:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:02,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788621736] [2023-12-05 21:17:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788621736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640056191] [2023-12-05 21:17:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:02,940 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:02,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:02,941 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 349 [2023-12-05 21:17:02,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 349 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:17:02,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:02,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 349 [2023-12-05 21:17:02,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:57,675 INFO L124 PetriNetUnfolderBase]: 143736/339913 cut-off events. [2023-12-05 21:17:57,675 INFO L125 PetriNetUnfolderBase]: For 3121/3121 co-relation queries the response was YES. [2023-12-05 21:18:00,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539494 conditions, 339913 events. 143736/339913 cut-off events. For 3121/3121 co-relation queries the response was YES. Maximal size of possible extension queue 4968. Compared 4702533 event pairs, 121837 based on Foata normal form. 127251/456451 useless extension candidates. Maximal degree in co-relation 33239. Up to 168696 conditions per place. [2023-12-05 21:18:02,242 INFO L140 encePairwiseOnDemand]: 290/349 looper letters, 67 selfloop transitions, 1 changer transitions 41/316 dead transitions. [2023-12-05 21:18:02,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 316 transitions, 873 flow [2023-12-05 21:18:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:18:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:18:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2023-12-05 21:18:02,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8127984718242598 [2023-12-05 21:18:02,255 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 851 transitions. [2023-12-05 21:18:02,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 851 transitions. [2023-12-05 21:18:02,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:18:02,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 851 transitions. [2023-12-05 21:18:02,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.6666666666667) internal successors, (851), 3 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:18:02,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:18:02,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:18:02,259 INFO L308 CegarLoopForPetriNet]: 297 programPoint places, -12 predicate places. [2023-12-05 21:18:02,259 INFO L500 AbstractCegarLoop]: Abstraction has has 285 places, 316 transitions, 873 flow [2023-12-05 21:18:02,260 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:18:02,260 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:18:02,260 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:18:02,260 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:18:02,260 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:18:02,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:18:02,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1159909494, now seen corresponding path program 1 times [2023-12-05 21:18:02,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:18:02,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674300246] [2023-12-05 21:18:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:02,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:18:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:18:02,387 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:18:02,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:18:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674300246] [2023-12-05 21:18:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674300246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:18:02,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:18:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:18:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368737245] [2023-12-05 21:18:02,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:18:02,388 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:18:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:18:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:18:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:18:02,390 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 349 [2023-12-05 21:18:02,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 316 transitions, 873 flow. Second operand has 4 states, 4 states have (on average 214.5) internal successors, (858), 4 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:18:02,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:18:02,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 349 [2023-12-05 21:18:02,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand