/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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_41-trylock_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:19:46,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:19:46,599 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-11-30 05:19:46,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:19:46,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:19:46,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:19:46,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:19:46,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:19:46,626 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:19:46,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:19:46,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:19:46,630 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:19:46,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:19:46,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:19:46,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:19:46,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:19:46,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:19:46,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:19:46,631 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:19:46,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:19:46,632 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:19:46,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:19:46,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:19:46,633 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:19:46,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:19:46,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:19:46,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:19:46,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:19:46,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:19:46,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:19:46,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:19:46,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:19:46,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:19:46,635 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-11-30 05:19:46,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:19:46,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:19:46,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:19:46,859 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:19:46,859 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:19:46,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i [2023-11-30 05:19:47,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:19:48,134 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:19:48,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_41-trylock_racefree.i [2023-11-30 05:19:48,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee77a684a/1a743810c56047f3b358675e6c3388a7/FLAGcdb25891e [2023-11-30 05:19:48,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee77a684a/1a743810c56047f3b358675e6c3388a7 [2023-11-30 05:19:48,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:19:48,159 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:19:48,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:19:48,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:19:48,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:19:48,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd97a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48, skipping insertion in model container [2023-11-30 05:19:48,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:19:48,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:19:48,446 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:19:48,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:19:48,523 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:19:48,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48 WrapperNode [2023-11-30 05:19:48,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:19:48,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:19:48,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:19:48,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:19:48,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,573 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2023-11-30 05:19:48,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:19:48,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:19:48,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:19:48,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:19:48,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:19:48,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:19:48,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:19:48,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:19:48,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (1/1) ... [2023-11-30 05:19:48,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:19:48,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:19:48,634 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-11-30 05:19:48,641 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-11-30 05:19:48,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:19:48,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 05:19:48,655 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 05:19:48,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:19:48,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:19:48,656 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 05:19:48,774 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:19:48,775 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:19:48,956 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:19:48,983 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:19:48,983 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-30 05:19:48,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:19:48 BoogieIcfgContainer [2023-11-30 05:19:48,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:19:48,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:19:48,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:19:48,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:19:48,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:19:48" (1/3) ... [2023-11-30 05:19:48,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e773747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:19:48, skipping insertion in model container [2023-11-30 05:19:48,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:19:48" (2/3) ... [2023-11-30 05:19:48,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e773747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:19:48, skipping insertion in model container [2023-11-30 05:19:48,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:19:48" (3/3) ... [2023-11-30 05:19:48,990 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_41-trylock_racefree.i [2023-11-30 05:19:49,002 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:19:49,002 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-30 05:19:49,002 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:19:49,043 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 05:19:49,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 120 transitions, 247 flow [2023-11-30 05:19:49,124 INFO L124 PetriNetUnfolderBase]: 23/172 cut-off events. [2023-11-30 05:19:49,125 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 05:19:49,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 172 events. 23/172 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 511 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 88. Up to 6 conditions per place. [2023-11-30 05:19:49,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 120 transitions, 247 flow [2023-11-30 05:19:49,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 120 transitions, 247 flow [2023-11-30 05:19:49,152 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:19:49,157 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;@f6bb199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:19:49,158 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:19:49,175 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:19:49,175 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-11-30 05:19:49,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:19:49,175 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:49,176 INFO L232 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] [2023-11-30 05:19:49,176 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-11-30 05:19:49,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 248364622, now seen corresponding path program 1 times [2023-11-30 05:19:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:49,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725465483] [2023-11-30 05:19:49,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:49,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:49,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725465483] [2023-11-30 05:19:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725465483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:19:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:19:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:19:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109570905] [2023-11-30 05:19:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:19:49,377 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:19:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:19:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:19:49,399 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 120 [2023-11-30 05:19:49,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 120 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:49,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:49,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 120 [2023-11-30 05:19:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:49,595 INFO L124 PetriNetUnfolderBase]: 69/430 cut-off events. [2023-11-30 05:19:49,595 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 05:19:49,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 430 events. 69/430 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2234 event pairs, 48 based on Foata normal form. 82/478 useless extension candidates. Maximal degree in co-relation 507. Up to 121 conditions per place. [2023-11-30 05:19:49,601 INFO L140 encePairwiseOnDemand]: 103/120 looper letters, 22 selfloop transitions, 1 changer transitions 17/108 dead transitions. [2023-11-30 05:19:49,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 287 flow [2023-11-30 05:19:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:19:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:19:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2023-11-30 05:19:49,617 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7972222222222223 [2023-11-30 05:19:49,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2023-11-30 05:19:49,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2023-11-30 05:19:49,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:49,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2023-11-30 05:19:49,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:49,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:49,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:49,638 INFO L307 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2023-11-30 05:19:49,638 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 287 flow [2023-11-30 05:19:49,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:49,639 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:49,639 INFO L232 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] [2023-11-30 05:19:49,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:19:49,639 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-11-30 05:19:49,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 248364623, now seen corresponding path program 1 times [2023-11-30 05:19:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:49,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491858450] [2023-11-30 05:19:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491858450] [2023-11-30 05:19:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491858450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:19:49,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:19:49,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:19:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336840029] [2023-11-30 05:19:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:19:49,872 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:19:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:19:49,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:19:49,874 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 120 [2023-11-30 05:19:49,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:49,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:49,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 120 [2023-11-30 05:19:49,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:49,995 INFO L124 PetriNetUnfolderBase]: 103/495 cut-off events. [2023-11-30 05:19:49,996 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-11-30 05:19:49,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 495 events. 103/495 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2600 event pairs, 6 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 835. Up to 174 conditions per place. [2023-11-30 05:19:50,000 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 33 selfloop transitions, 3 changer transitions 17/122 dead transitions. [2023-11-30 05:19:50,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 122 transitions, 443 flow [2023-11-30 05:19:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:19:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:19:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-11-30 05:19:50,002 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.70625 [2023-11-30 05:19:50,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-11-30 05:19:50,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-11-30 05:19:50,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:50,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-11-30 05:19:50,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,007 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,007 INFO L307 CegarLoopForPetriNet]: 108 programPoint places, 0 predicate places. [2023-11-30 05:19:50,008 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 122 transitions, 443 flow [2023-11-30 05:19:50,008 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,008 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:50,008 INFO L232 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] [2023-11-30 05:19:50,008 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:19:50,009 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-11-30 05:19:50,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1860005606, now seen corresponding path program 1 times [2023-11-30 05:19:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:50,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002837339] [2023-11-30 05:19:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:50,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002837339] [2023-11-30 05:19:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002837339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:19:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4960069] [2023-11-30 05:19:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:50,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:19:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:19:50,192 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-11-30 05:19:50,194 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-11-30 05:19:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:50,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:19:50,274 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:19:50,368 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-11-30 05:19:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:50,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:19:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4960069] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:19:50,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:19:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-11-30 05:19:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595205570] [2023-11-30 05:19:50,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:19:50,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 05:19:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 05:19:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-30 05:19:50,660 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 120 [2023-11-30 05:19:50,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 122 transitions, 443 flow. Second operand has 15 states, 15 states have (on average 74.33333333333333) internal successors, (1115), 15 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:50,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 120 [2023-11-30 05:19:50,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:50,793 INFO L124 PetriNetUnfolderBase]: 30/165 cut-off events. [2023-11-30 05:19:50,793 INFO L125 PetriNetUnfolderBase]: For 114/138 co-relation queries the response was YES. [2023-11-30 05:19:50,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 165 events. 30/165 cut-off events. For 114/138 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 481 event pairs, 6 based on Foata normal form. 3/164 useless extension candidates. Maximal degree in co-relation 306. Up to 46 conditions per place. [2023-11-30 05:19:50,794 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 34 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-11-30 05:19:50,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 388 flow [2023-11-30 05:19:50,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 05:19:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 05:19:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2023-11-30 05:19:50,795 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2023-11-30 05:19:50,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 545 transitions. [2023-11-30 05:19:50,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 545 transitions. [2023-11-30 05:19:50,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:50,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 545 transitions. [2023-11-30 05:19:50,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,798 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,799 INFO L307 CegarLoopForPetriNet]: 108 programPoint places, -33 predicate places. [2023-11-30 05:19:50,800 INFO L500 AbstractCegarLoop]: Abstraction has has 75 places, 81 transitions, 388 flow [2023-11-30 05:19:50,800 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 74.33333333333333) internal successors, (1115), 15 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:50,801 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:50,801 INFO L232 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] [2023-11-30 05:19:50,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 05:19:51,006 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-11-30 05:19:51,007 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-11-30 05:19:51,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1825598625, now seen corresponding path program 1 times [2023-11-30 05:19:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798232721] [2023-11-30 05:19:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:19:51,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:19:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:19:51,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:19:51,048 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:19:51,049 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:19:51,050 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:19:51,050 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:19:51,050 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:19:51,050 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:19:51,050 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:19:51,051 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 05:19:51,052 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:19:51,052 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 05:19:51,070 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 05:19:51,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 153 transitions, 322 flow [2023-11-30 05:19:51,089 INFO L124 PetriNetUnfolderBase]: 40/285 cut-off events. [2023-11-30 05:19:51,089 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:19:51,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 285 events. 40/285 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 985 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 174. Up to 9 conditions per place. [2023-11-30 05:19:51,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 153 transitions, 322 flow [2023-11-30 05:19:51,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 153 transitions, 322 flow [2023-11-30 05:19:51,093 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:19:51,093 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;@f6bb199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:19:51,094 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:19:51,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:19:51,096 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-11-30 05:19:51,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:19:51,096 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:51,096 INFO L232 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] [2023-11-30 05:19:51,096 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-11-30 05:19:51,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -123419865, now seen corresponding path program 1 times [2023-11-30 05:19:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:51,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151276155] [2023-11-30 05:19:51,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151276155] [2023-11-30 05:19:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151276155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:19:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:19:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:19:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911093962] [2023-11-30 05:19:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:19:51,122 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:19:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:19:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:19:51,123 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 153 [2023-11-30 05:19:51,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 153 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:51,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:51,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 153 [2023-11-30 05:19:51,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:51,489 INFO L124 PetriNetUnfolderBase]: 1104/3685 cut-off events. [2023-11-30 05:19:51,490 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-11-30 05:19:51,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5561 conditions, 3685 events. 1104/3685 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32139 event pairs, 786 based on Foata normal form. 995/4422 useless extension candidates. Maximal degree in co-relation 743. Up to 1341 conditions per place. [2023-11-30 05:19:51,503 INFO L140 encePairwiseOnDemand]: 130/153 looper letters, 30 selfloop transitions, 1 changer transitions 17/141 dead transitions. [2023-11-30 05:19:51,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 141 transitions, 390 flow [2023-11-30 05:19:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:19:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:19:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-30 05:19:51,504 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8061002178649237 [2023-11-30 05:19:51,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-30 05:19:51,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-30 05:19:51,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:51,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-30 05:19:51,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:51,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:51,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:51,507 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, -3 predicate places. [2023-11-30 05:19:51,507 INFO L500 AbstractCegarLoop]: Abstraction has has 133 places, 141 transitions, 390 flow [2023-11-30 05:19:51,507 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:51,507 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:51,507 INFO L232 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] [2023-11-30 05:19:51,507 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:19:51,508 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-11-30 05:19:51,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -123419864, now seen corresponding path program 1 times [2023-11-30 05:19:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144408142] [2023-11-30 05:19:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:51,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:51,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144408142] [2023-11-30 05:19:51,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144408142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:19:51,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:19:51,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:19:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534983953] [2023-11-30 05:19:51,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:19:51,555 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:19:51,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:51,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:19:51,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:19:51,556 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 153 [2023-11-30 05:19:51,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 141 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:51,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:51,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 153 [2023-11-30 05:19:51,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:51,949 INFO L124 PetriNetUnfolderBase]: 1588/4542 cut-off events. [2023-11-30 05:19:51,949 INFO L125 PetriNetUnfolderBase]: For 955/955 co-relation queries the response was YES. [2023-11-30 05:19:51,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9387 conditions, 4542 events. 1588/4542 cut-off events. For 955/955 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 39837 event pairs, 570 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 1207. Up to 2193 conditions per place. [2023-11-30 05:19:52,039 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 43 selfloop transitions, 3 changer transitions 29/163 dead transitions. [2023-11-30 05:19:52,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 163 transitions, 618 flow [2023-11-30 05:19:52,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:19:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:19:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-11-30 05:19:52,041 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.704248366013072 [2023-11-30 05:19:52,041 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-11-30 05:19:52,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-11-30 05:19:52,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:52,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-11-30 05:19:52,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,043 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,045 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2023-11-30 05:19:52,045 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 163 transitions, 618 flow [2023-11-30 05:19:52,045 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,045 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:52,046 INFO L232 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] [2023-11-30 05:19:52,046 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:19:52,046 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-11-30 05:19:52,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash 361127188, now seen corresponding path program 1 times [2023-11-30 05:19:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:52,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153918136] [2023-11-30 05:19:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:52,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153918136] [2023-11-30 05:19:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153918136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:19:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8675066] [2023-11-30 05:19:52,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:52,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:19:52,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:19:52,216 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-11-30 05:19:52,247 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-11-30 05:19:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:52,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:19:52,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:19:52,290 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-11-30 05:19:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:52,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:19:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:52,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8675066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:19:52,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:19:52,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-11-30 05:19:52,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116945281] [2023-11-30 05:19:52,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:19:52,482 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 05:19:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:52,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 05:19:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-30 05:19:52,485 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 153 [2023-11-30 05:19:52,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 163 transitions, 618 flow. Second operand has 15 states, 15 states have (on average 93.33333333333333) internal successors, (1400), 15 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:52,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 153 [2023-11-30 05:19:52,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:52,794 INFO L124 PetriNetUnfolderBase]: 492/1270 cut-off events. [2023-11-30 05:19:52,794 INFO L125 PetriNetUnfolderBase]: For 1057/1204 co-relation queries the response was YES. [2023-11-30 05:19:52,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 1270 events. 492/1270 cut-off events. For 1057/1204 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 8294 event pairs, 0 based on Foata normal form. 6/1255 useless extension candidates. Maximal degree in co-relation 468. Up to 753 conditions per place. [2023-11-30 05:19:52,802 INFO L140 encePairwiseOnDemand]: 146/153 looper letters, 79 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2023-11-30 05:19:52,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 148 transitions, 806 flow [2023-11-30 05:19:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:19:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:19:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1001 transitions. [2023-11-30 05:19:52,805 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6542483660130719 [2023-11-30 05:19:52,805 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1001 transitions. [2023-11-30 05:19:52,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1001 transitions. [2023-11-30 05:19:52,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:52,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1001 transitions. [2023-11-30 05:19:52,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.1) internal successors, (1001), 10 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,811 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 153.0) internal successors, (1683), 11 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,813 INFO L307 CegarLoopForPetriNet]: 136 programPoint places, -30 predicate places. [2023-11-30 05:19:52,813 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 148 transitions, 806 flow [2023-11-30 05:19:52,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.33333333333333) internal successors, (1400), 15 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:52,813 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:52,814 INFO L232 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] [2023-11-30 05:19:52,821 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-11-30 05:19:53,018 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-11-30 05:19:53,020 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-11-30 05:19:53,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash 809710770, now seen corresponding path program 1 times [2023-11-30 05:19:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:53,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857405015] [2023-11-30 05:19:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:19:53,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:19:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:19:53,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:19:53,044 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:19:53,044 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:19:53,044 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:19:53,045 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:19:53,045 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:19:53,045 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:19:53,045 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:19:53,045 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 05:19:53,045 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:19:53,045 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 05:19:53,063 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-30 05:19:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 186 transitions, 399 flow [2023-11-30 05:19:53,095 INFO L124 PetriNetUnfolderBase]: 62/437 cut-off events. [2023-11-30 05:19:53,095 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-30 05:19:53,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 437 events. 62/437 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1664 event pairs, 1 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 293. Up to 16 conditions per place. [2023-11-30 05:19:53,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 186 transitions, 399 flow [2023-11-30 05:19:53,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 186 transitions, 399 flow [2023-11-30 05:19:53,102 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:19:53,102 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;@f6bb199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:19:53,102 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:19:53,104 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:19:53,104 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-11-30 05:19:53,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:19:53,104 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:53,104 INFO L232 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] [2023-11-30 05:19:53,104 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-11-30 05:19:53,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash -912253343, now seen corresponding path program 1 times [2023-11-30 05:19:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701288509] [2023-11-30 05:19:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:53,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701288509] [2023-11-30 05:19:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701288509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:19:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:19:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:19:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332040629] [2023-11-30 05:19:53,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:19:53,127 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:19:53,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:53,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:19:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:19:53,128 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 186 [2023-11-30 05:19:53,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 186 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:53,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:53,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 186 [2023-11-30 05:19:53,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:19:56,252 INFO L124 PetriNetUnfolderBase]: 12726/31743 cut-off events. [2023-11-30 05:19:56,253 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-11-30 05:19:56,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50353 conditions, 31743 events. 12726/31743 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 353356 event pairs, 9043 based on Foata normal form. 10398/40238 useless extension candidates. Maximal degree in co-relation 5550. Up to 13148 conditions per place. [2023-11-30 05:19:56,454 INFO L140 encePairwiseOnDemand]: 157/186 looper letters, 38 selfloop transitions, 1 changer transitions 23/174 dead transitions. [2023-11-30 05:19:56,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 495 flow [2023-11-30 05:19:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:19:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:19:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-30 05:19:56,456 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8118279569892473 [2023-11-30 05:19:56,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-30 05:19:56,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-30 05:19:56,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:19:56,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-30 05:19:56,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:56,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:56,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:56,459 INFO L307 CegarLoopForPetriNet]: 164 programPoint places, -3 predicate places. [2023-11-30 05:19:56,459 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 174 transitions, 495 flow [2023-11-30 05:19:56,460 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:56,460 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:19:56,460 INFO L232 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] [2023-11-30 05:19:56,460 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:19:56,460 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-11-30 05:19:56,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:19:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -912253342, now seen corresponding path program 1 times [2023-11-30 05:19:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:19:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961658268] [2023-11-30 05:19:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:19:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:19:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:19:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:19:56,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:19:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961658268] [2023-11-30 05:19:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961658268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:19:56,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:19:56,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:19:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852561703] [2023-11-30 05:19:56,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:19:56,508 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:19:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:19:56,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:19:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:19:56,509 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 186 [2023-11-30 05:19:56,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 174 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:19:56,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:19:56,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 186 [2023-11-30 05:19:56,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:20:00,108 INFO L124 PetriNetUnfolderBase]: 17536/42554 cut-off events. [2023-11-30 05:20:00,108 INFO L125 PetriNetUnfolderBase]: For 7151/7881 co-relation queries the response was YES. [2023-11-30 05:20:00,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90777 conditions, 42554 events. 17536/42554 cut-off events. For 7151/7881 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 485618 event pairs, 8953 based on Foata normal form. 0/40450 useless extension candidates. Maximal degree in co-relation 9815. Up to 21545 conditions per place. [2023-11-30 05:20:00,687 INFO L140 encePairwiseOnDemand]: 180/186 looper letters, 51 selfloop transitions, 3 changer transitions 41/202 dead transitions. [2023-11-30 05:20:00,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 202 transitions, 787 flow [2023-11-30 05:20:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:20:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:20:00,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-11-30 05:20:00,689 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7002688172043011 [2023-11-30 05:20:00,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-11-30 05:20:00,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-11-30 05:20:00,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:20:00,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-11-30 05:20:00,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:00,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:00,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:00,693 INFO L307 CegarLoopForPetriNet]: 164 programPoint places, 0 predicate places. [2023-11-30 05:20:00,693 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 787 flow [2023-11-30 05:20:00,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:00,694 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:20:00,694 INFO L232 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] [2023-11-30 05:20:00,694 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 05:20:00,694 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-11-30 05:20:00,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:20:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash 754024143, now seen corresponding path program 1 times [2023-11-30 05:20:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:20:00,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253985111] [2023-11-30 05:20:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:00,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:20:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:20:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:00,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:20:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253985111] [2023-11-30 05:20:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253985111] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:20:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649089140] [2023-11-30 05:20:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:00,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:20:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:20:00,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:20:00,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 05:20:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:20:00,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:20:00,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:20:00,876 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-11-30 05:20:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:00,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:20:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:01,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649089140] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:20:01,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:20:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-30 05:20:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879514258] [2023-11-30 05:20:01,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:20:01,014 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 05:20:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:20:01,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 05:20:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-30 05:20:01,015 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 186 [2023-11-30 05:20:01,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 787 flow. Second operand has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:01,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:20:01,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 186 [2023-11-30 05:20:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:20:05,078 INFO L124 PetriNetUnfolderBase]: 18662/40930 cut-off events. [2023-11-30 05:20:05,078 INFO L125 PetriNetUnfolderBase]: For 20985/25675 co-relation queries the response was YES. [2023-11-30 05:20:05,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116712 conditions, 40930 events. 18662/40930 cut-off events. For 20985/25675 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 435737 event pairs, 1100 based on Foata normal form. 3/37637 useless extension candidates. Maximal degree in co-relation 12359. Up to 22293 conditions per place. [2023-11-30 05:20:05,417 INFO L140 encePairwiseOnDemand]: 176/186 looper letters, 120 selfloop transitions, 11 changer transitions 41/278 dead transitions. [2023-11-30 05:20:05,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 278 transitions, 1563 flow [2023-11-30 05:20:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:20:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:20:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1255 transitions. [2023-11-30 05:20:05,420 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6747311827956989 [2023-11-30 05:20:05,420 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1255 transitions. [2023-11-30 05:20:05,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1255 transitions. [2023-11-30 05:20:05,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:20:05,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1255 transitions. [2023-11-30 05:20:05,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.5) internal successors, (1255), 10 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:05,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:05,426 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 186.0) internal successors, (2046), 11 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:05,426 INFO L307 CegarLoopForPetriNet]: 164 programPoint places, 9 predicate places. [2023-11-30 05:20:05,427 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 278 transitions, 1563 flow [2023-11-30 05:20:05,427 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.63636363636364) internal successors, (1239), 11 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:05,427 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:20:05,427 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:20:05,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-30 05:20:05,632 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:20:05,634 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:20:05,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:20:05,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1583244410, now seen corresponding path program 1 times [2023-11-30 05:20:05,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:20:05,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155328793] [2023-11-30 05:20:05,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:20:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:20:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:20:05,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155328793] [2023-11-30 05:20:05,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155328793] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:20:05,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915762579] [2023-11-30 05:20:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:05,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:20:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:20:05,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:20:05,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 05:20:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:20:05,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 05:20:05,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:20:05,899 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-11-30 05:20:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:06,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:20:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915762579] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:20:06,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:20:06,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-30 05:20:06,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572123692] [2023-11-30 05:20:06,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:20:06,406 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 05:20:06,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:20:06,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 05:20:06,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-11-30 05:20:06,408 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 186 [2023-11-30 05:20:06,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 278 transitions, 1563 flow. Second operand has 23 states, 23 states have (on average 112.82608695652173) internal successors, (2595), 23 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:06,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:20:06,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 186 [2023-11-30 05:20:06,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:20:07,888 INFO L124 PetriNetUnfolderBase]: 5490/10951 cut-off events. [2023-11-30 05:20:07,888 INFO L125 PetriNetUnfolderBase]: For 14509/17102 co-relation queries the response was YES. [2023-11-30 05:20:07,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40754 conditions, 10951 events. 5490/10951 cut-off events. For 14509/17102 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 93233 event pairs, 81 based on Foata normal form. 273/11067 useless extension candidates. Maximal degree in co-relation 4340. Up to 7466 conditions per place. [2023-11-30 05:20:07,973 INFO L140 encePairwiseOnDemand]: 179/186 looper letters, 160 selfloop transitions, 11 changer transitions 0/251 dead transitions. [2023-11-30 05:20:07,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 251 transitions, 1856 flow [2023-11-30 05:20:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-30 05:20:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-30 05:20:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1586 transitions. [2023-11-30 05:20:07,977 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2023-11-30 05:20:07,977 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1586 transitions. [2023-11-30 05:20:07,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1586 transitions. [2023-11-30 05:20:07,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:20:07,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1586 transitions. [2023-11-30 05:20:07,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.0) internal successors, (1586), 13 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:07,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 186.0) internal successors, (2604), 14 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:07,982 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 186.0) internal successors, (2604), 14 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:07,983 INFO L307 CegarLoopForPetriNet]: 164 programPoint places, -18 predicate places. [2023-11-30 05:20:07,983 INFO L500 AbstractCegarLoop]: Abstraction has has 146 places, 251 transitions, 1856 flow [2023-11-30 05:20:07,984 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 112.82608695652173) internal successors, (2595), 23 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:07,984 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:20:07,984 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:20:07,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-30 05:20:08,188 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:20:08,189 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:20:08,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:20:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1835935740, now seen corresponding path program 1 times [2023-11-30 05:20:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:20:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680763540] [2023-11-30 05:20:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:20:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:20:08,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:20:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:20:08,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:20:08,225 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:20:08,225 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:20:08,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:20:08,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:20:08,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:20:08,226 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:20:08,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 05:20:08,226 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 05:20:08,227 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:20:08,227 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 05:20:08,253 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-30 05:20:08,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 219 transitions, 478 flow [2023-11-30 05:20:08,296 INFO L124 PetriNetUnfolderBase]: 96/669 cut-off events. [2023-11-30 05:20:08,297 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-30 05:20:08,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 720 conditions, 669 events. 96/669 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2895 event pairs, 6 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 457. Up to 32 conditions per place. [2023-11-30 05:20:08,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 219 transitions, 478 flow [2023-11-30 05:20:08,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 219 transitions, 478 flow [2023-11-30 05:20:08,307 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:20:08,307 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;@f6bb199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:20:08,307 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:20:08,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:20:08,309 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-11-30 05:20:08,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:20:08,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:20:08,309 INFO L232 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] [2023-11-30 05:20:08,309 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-11-30 05:20:08,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:20:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2118135812, now seen corresponding path program 1 times [2023-11-30 05:20:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:20:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456686453] [2023-11-30 05:20:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:08,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:20:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:20:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:20:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456686453] [2023-11-30 05:20:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456686453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:20:08,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:20:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:20:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139465729] [2023-11-30 05:20:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:20:08,330 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:20:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:20:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:20:08,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:20:08,331 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 219 [2023-11-30 05:20:08,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 219 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:08,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:20:08,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 219 [2023-11-30 05:20:08,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:20:39,822 INFO L124 PetriNetUnfolderBase]: 129362/270599 cut-off events. [2023-11-30 05:20:39,823 INFO L125 PetriNetUnfolderBase]: For 10376/10376 co-relation queries the response was YES. [2023-11-30 05:20:41,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445278 conditions, 270599 events. 129362/270599 cut-off events. For 10376/10376 co-relation queries the response was YES. Maximal size of possible extension queue 5541. Compared 3463867 event pairs, 90828 based on Foata normal form. 100078/356265 useless extension candidates. Maximal degree in co-relation 50378. Up to 121191 conditions per place. [2023-11-30 05:20:42,592 INFO L140 encePairwiseOnDemand]: 184/219 looper letters, 46 selfloop transitions, 1 changer transitions 29/207 dead transitions. [2023-11-30 05:20:42,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 207 transitions, 602 flow [2023-11-30 05:20:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:20:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:20:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2023-11-30 05:20:42,593 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8158295281582952 [2023-11-30 05:20:42,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2023-11-30 05:20:42,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2023-11-30 05:20:42,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:20:42,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2023-11-30 05:20:42,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:42,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:42,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:42,595 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, -3 predicate places. [2023-11-30 05:20:42,596 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 207 transitions, 602 flow [2023-11-30 05:20:42,596 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:42,596 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:20:42,596 INFO L232 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] [2023-11-30 05:20:42,596 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:20:42,596 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-11-30 05:20:42,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:20:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2118135811, now seen corresponding path program 1 times [2023-11-30 05:20:42,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:20:42,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024163826] [2023-11-30 05:20:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:20:42,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:20:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:20:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:20:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:20:42,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024163826] [2023-11-30 05:20:42,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024163826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:20:42,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:20:42,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:20:42,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807685275] [2023-11-30 05:20:42,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:20:42,642 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:20:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:20:42,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:20:42,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:20:42,643 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 219 [2023-11-30 05:20:42,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 207 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:20:42,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:20:42,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 219 [2023-11-30 05:20:42,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:21:21,533 INFO L124 PetriNetUnfolderBase]: 175332/363730 cut-off events. [2023-11-30 05:21:21,533 INFO L125 PetriNetUnfolderBase]: For 58714/64694 co-relation queries the response was YES. [2023-11-30 05:21:23,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814844 conditions, 363730 events. 175332/363730 cut-off events. For 58714/64694 co-relation queries the response was YES. Maximal size of possible extension queue 7102. Compared 4776869 event pairs, 100902 based on Foata normal form. 0/348333 useless extension candidates. Maximal degree in co-relation 91841. Up to 197767 conditions per place. [2023-11-30 05:21:25,706 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 59 selfloop transitions, 3 changer transitions 53/241 dead transitions. [2023-11-30 05:21:25,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 241 transitions, 958 flow [2023-11-30 05:21:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:21:25,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:21:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 611 transitions. [2023-11-30 05:21:25,709 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6974885844748858 [2023-11-30 05:21:25,709 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 611 transitions. [2023-11-30 05:21:25,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 611 transitions. [2023-11-30 05:21:25,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:21:25,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 611 transitions. [2023-11-30 05:21:25,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:21:25,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:21:25,711 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:21:25,712 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, 0 predicate places. [2023-11-30 05:21:25,712 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 241 transitions, 958 flow [2023-11-30 05:21:25,712 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:21:25,712 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:21:25,712 INFO L232 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] [2023-11-30 05:21:25,712 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 05:21:25,712 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-11-30 05:21:25,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:21:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash -681314741, now seen corresponding path program 1 times [2023-11-30 05:21:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:21:25,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061016253] [2023-11-30 05:21:25,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:21:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:21:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:21:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:21:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:21:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061016253] [2023-11-30 05:21:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061016253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:21:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13107642] [2023-11-30 05:21:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:21:25,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:21:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:21:25,826 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:21:25,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 05:21:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:21:25,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 05:21:25,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:21:25,918 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-11-30 05:21:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:21:25,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:21:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:21:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13107642] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:21:26,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:21:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-11-30 05:21:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832747747] [2023-11-30 05:21:26,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:21:26,058 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-30 05:21:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:21:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-30 05:21:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-30 05:21:26,059 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 219 [2023-11-30 05:21:26,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 241 transitions, 958 flow. Second operand has 15 states, 15 states have (on average 131.33333333333334) internal successors, (1970), 15 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:21:26,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:21:26,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 219 [2023-11-30 05:21:26,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:22:09,965 INFO L124 PetriNetUnfolderBase]: 185558/349057 cut-off events. [2023-11-30 05:22:09,965 INFO L125 PetriNetUnfolderBase]: For 170906/198055 co-relation queries the response was YES. [2023-11-30 05:22:12,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055547 conditions, 349057 events. 185558/349057 cut-off events. For 170906/198055 co-relation queries the response was YES. Maximal size of possible extension queue 6715. Compared 4194704 event pairs, 11089 based on Foata normal form. 6/326020 useless extension candidates. Maximal degree in co-relation 117134. Up to 205067 conditions per place. [2023-11-30 05:22:14,684 INFO L140 encePairwiseOnDemand]: 209/219 looper letters, 155 selfloop transitions, 12 changer transitions 53/345 dead transitions. [2023-11-30 05:22:14,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 345 transitions, 2002 flow [2023-11-30 05:22:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-30 05:22:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-30 05:22:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1617 transitions. [2023-11-30 05:22:14,688 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6712328767123288 [2023-11-30 05:22:14,688 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1617 transitions. [2023-11-30 05:22:14,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1617 transitions. [2023-11-30 05:22:14,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:22:14,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1617 transitions. [2023-11-30 05:22:14,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.0) internal successors, (1617), 11 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:14,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:14,693 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:14,694 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, 10 predicate places. [2023-11-30 05:22:14,694 INFO L500 AbstractCegarLoop]: Abstraction has has 202 places, 345 transitions, 2002 flow [2023-11-30 05:22:14,694 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 131.33333333333334) internal successors, (1970), 15 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:14,694 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:22:14,694 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:22:14,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-30 05:22:14,898 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 05:22:14,899 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:22:14,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:22:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash 925089540, now seen corresponding path program 1 times [2023-11-30 05:22:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:22:14,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241746877] [2023-11-30 05:22:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:14,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:22:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:22:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241746877] [2023-11-30 05:22:15,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241746877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 05:22:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574064883] [2023-11-30 05:22:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:22:15,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 05:22:15,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:22:15,071 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 05:22:15,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 05:22:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:22:15,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-30 05:22:15,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 05:22:15,168 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-11-30 05:22:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:15,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 05:22:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:22:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574064883] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 05:22:15,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 05:22:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-30 05:22:15,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040391178] [2023-11-30 05:22:15,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 05:22:15,550 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-30 05:22:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:22:15,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-30 05:22:15,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-11-30 05:22:15,552 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 219 [2023-11-30 05:22:15,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 345 transitions, 2002 flow. Second operand has 23 states, 23 states have (on average 131.82608695652175) internal successors, (3032), 23 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:22:15,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:22:15,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 219 [2023-11-30 05:22:15,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:23:04,379 INFO L124 PetriNetUnfolderBase]: 170466/330642 cut-off events. [2023-11-30 05:23:04,380 INFO L125 PetriNetUnfolderBase]: For 259864/287400 co-relation queries the response was YES. [2023-11-30 05:23:06,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201650 conditions, 330642 events. 170466/330642 cut-off events. For 259864/287400 co-relation queries the response was YES. Maximal size of possible extension queue 6109. Compared 4029848 event pairs, 6539 based on Foata normal form. 2647/316062 useless extension candidates. Maximal degree in co-relation 132745. Up to 185859 conditions per place. [2023-11-30 05:23:09,238 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 324 selfloop transitions, 15 changer transitions 53/517 dead transitions. [2023-11-30 05:23:09,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 517 transitions, 4148 flow [2023-11-30 05:23:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-30 05:23:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-30 05:23:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2367 transitions. [2023-11-30 05:23:09,252 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.675513698630137 [2023-11-30 05:23:09,252 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2367 transitions. [2023-11-30 05:23:09,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2367 transitions. [2023-11-30 05:23:09,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:23:09,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2367 transitions. [2023-11-30 05:23:09,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 147.9375) internal successors, (2367), 16 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:09,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 219.0) internal successors, (3723), 17 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:09,268 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 219.0) internal successors, (3723), 17 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:09,269 INFO L307 CegarLoopForPetriNet]: 192 programPoint places, 24 predicate places. [2023-11-30 05:23:09,269 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 517 transitions, 4148 flow [2023-11-30 05:23:09,270 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 131.82608695652175) internal successors, (3032), 23 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:09,270 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:23:09,270 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:23:09,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-30 05:23:09,470 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 05:23:09,471 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-11-30 05:23:09,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:23:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash 29697461, now seen corresponding path program 1 times [2023-11-30 05:23:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:23:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343559615] [2023-11-30 05:23:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:23:09,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:23:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:23:09,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 05:23:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 05:23:09,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 05:23:09,511 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 05:23:09,511 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-30 05:23:09,511 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-11-30 05:23:09,511 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-11-30 05:23:09,511 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-11-30 05:23:09,511 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-11-30 05:23:09,511 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 05:23:09,511 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 05:23:09,512 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 05:23:09,512 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 05:23:09,533 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-30 05:23:09,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 252 transitions, 559 flow [2023-11-30 05:23:09,624 INFO L124 PetriNetUnfolderBase]: 158/1065 cut-off events. [2023-11-30 05:23:09,624 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-30 05:23:09,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 1065 events. 158/1065 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5392 event pairs, 23 based on Foata normal form. 0/847 useless extension candidates. Maximal degree in co-relation 714. Up to 80 conditions per place. [2023-11-30 05:23:09,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 252 transitions, 559 flow [2023-11-30 05:23:09,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 252 transitions, 559 flow [2023-11-30 05:23:09,644 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:23:09,644 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;@f6bb199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:23:09,644 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-30 05:23:09,645 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:23:09,645 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-11-30 05:23:09,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:23:09,646 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:23:09,646 INFO L232 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] [2023-11-30 05:23:09,646 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-11-30 05:23:09,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:23:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 553900024, now seen corresponding path program 1 times [2023-11-30 05:23:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:23:09,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296031249] [2023-11-30 05:23:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:23:09,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:23:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:23:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:23:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:23:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296031249] [2023-11-30 05:23:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296031249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:23:09,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:23:09,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:23:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544694125] [2023-11-30 05:23:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:23:09,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:23:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:23:09,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:23:09,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:23:09,666 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 252 [2023-11-30 05:23:09,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 252 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:23:09,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:23:09,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 252 [2023-11-30 05:23:09,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand