/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:15:02,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:15:02,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:15:02,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:15:02,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:15:02,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:15:02,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:15:02,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:15:02,134 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:15:02,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:15:02,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:15:02,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:15:02,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:15:02,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:15:02,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:15:02,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:15:02,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:15:02,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:15:02,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:15:02,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:15:02,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:15:02,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:15:02,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:15:02,144 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:15:02,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:15:02,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:15:02,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:15:02,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:15:02,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:15:02,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:15:02,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:15:02,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:15:02,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:15:02,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:15:02,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:15:02,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:15:02,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:15:02,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:15:02,335 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:15:02,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2023-12-05 21:15:03,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:15:03,468 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:15:03,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_12-ptr_racefree.i [2023-12-05 21:15:03,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df430148f/9ba1361b1345413ea228565329d5816e/FLAG867788d67 [2023-12-05 21:15:03,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df430148f/9ba1361b1345413ea228565329d5816e [2023-12-05 21:15:03,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:15:03,496 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:15:03,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:15:03,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:15:03,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:15:03,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4789e9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03, skipping insertion in model container [2023-12-05 21:15:03,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,539 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:15:03,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:15:03,765 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:15:03,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:15:03,835 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:15:03,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03 WrapperNode [2023-12-05 21:15:03,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:15:03,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:15:03,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:15:03,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:15:03,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,878 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2023-12-05 21:15:03,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:15:03,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:15:03,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:15:03,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:15:03,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:15:03,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:15:03,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:15:03,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:15:03,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (1/1) ... [2023-12-05 21:15:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:15:03,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:03,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:15:03,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:15:03,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:15:03,959 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:15:03,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:15:03,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:15:03,960 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:15:04,048 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:15:04,049 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:15:04,304 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:15:04,331 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:15:04,332 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:15:04,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:15:04 BoogieIcfgContainer [2023-12-05 21:15:04,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:15:04,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:15:04,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:15:04,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:15:04,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:15:03" (1/3) ... [2023-12-05 21:15:04,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c81e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:15:04, skipping insertion in model container [2023-12-05 21:15:04,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:15:03" (2/3) ... [2023-12-05 21:15:04,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68c81e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:15:04, skipping insertion in model container [2023-12-05 21:15:04,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:15:04" (3/3) ... [2023-12-05 21:15:04,344 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2023-12-05 21:15:04,356 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:15:04,356 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-05 21:15:04,356 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:15:04,417 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:15:04,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 145 transitions, 297 flow [2023-12-05 21:15:04,531 INFO L124 PetriNetUnfolderBase]: 19/197 cut-off events. [2023-12-05 21:15:04,531 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:15:04,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 197 events. 19/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 620 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 101. Up to 4 conditions per place. [2023-12-05 21:15:04,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 145 transitions, 297 flow [2023-12-05 21:15:04,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 145 transitions, 297 flow [2023-12-05 21:15:04,545 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:04,549 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;@22b46087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:04,549 INFO L363 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-12-05 21:15:04,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:04,558 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-12-05 21:15:04,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:04,558 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:04,559 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:04,559 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:15:04,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1472772833, now seen corresponding path program 1 times [2023-12-05 21:15:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:04,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055488884] [2023-12-05 21:15:04,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055488884] [2023-12-05 21:15:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055488884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:04,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:04,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722471121] [2023-12-05 21:15:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:04,791 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:04,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:04,815 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 145 [2023-12-05 21:15:04,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:04,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:04,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 145 [2023-12-05 21:15:04,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:04,995 INFO L124 PetriNetUnfolderBase]: 183/781 cut-off events. [2023-12-05 21:15:04,996 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:15:04,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 781 events. 183/781 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5114 event pairs, 140 based on Foata normal form. 132/795 useless extension candidates. Maximal degree in co-relation 1087. Up to 317 conditions per place. [2023-12-05 21:15:05,002 INFO L140 encePairwiseOnDemand]: 129/145 looper letters, 46 selfloop transitions, 2 changer transitions 3/142 dead transitions. [2023-12-05 21:15:05,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 142 transitions, 393 flow [2023-12-05 21:15:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-12-05 21:15:05,016 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8045977011494253 [2023-12-05 21:15:05,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-12-05 21:15:05,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-12-05 21:15:05,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:05,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-12-05 21:15:05,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,026 INFO L308 CegarLoopForPetriNet]: 135 programPoint places, -3 predicate places. [2023-12-05 21:15:05,026 INFO L500 AbstractCegarLoop]: Abstraction has has 132 places, 142 transitions, 393 flow [2023-12-05 21:15:05,027 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,027 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:05,027 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:15:05,027 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:15:05,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1472772832, now seen corresponding path program 1 times [2023-12-05 21:15:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666989389] [2023-12-05 21:15:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:05,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666989389] [2023-12-05 21:15:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666989389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201128509] [2023-12-05 21:15:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:05,195 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:05,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:05,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:05,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:05,196 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 145 [2023-12-05 21:15:05,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 142 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:05,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 145 [2023-12-05 21:15:05,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:05,442 INFO L124 PetriNetUnfolderBase]: 314/1147 cut-off events. [2023-12-05 21:15:05,442 INFO L125 PetriNetUnfolderBase]: For 242/266 co-relation queries the response was YES. [2023-12-05 21:15:05,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1147 events. 314/1147 cut-off events. For 242/266 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7689 event pairs, 54 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 2171. Up to 490 conditions per place. [2023-12-05 21:15:05,449 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 72 selfloop transitions, 4 changer transitions 6/172 dead transitions. [2023-12-05 21:15:05,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 172 transitions, 659 flow [2023-12-05 21:15:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:15:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:15:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-12-05 21:15:05,451 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7344827586206897 [2023-12-05 21:15:05,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-12-05 21:15:05,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-12-05 21:15:05,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:05,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-12-05 21:15:05,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,456 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,456 INFO L308 CegarLoopForPetriNet]: 135 programPoint places, 0 predicate places. [2023-12-05 21:15:05,457 INFO L500 AbstractCegarLoop]: Abstraction has has 135 places, 172 transitions, 659 flow [2023-12-05 21:15:05,457 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,457 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:05,457 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:15:05,457 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:15:05,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -154961732, now seen corresponding path program 1 times [2023-12-05 21:15:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282503890] [2023-12-05 21:15:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:05,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282503890] [2023-12-05 21:15:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282503890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:15:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120638815] [2023-12-05 21:15:05,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:05,649 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:15:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:15:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:15:05,652 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 145 [2023-12-05 21:15:05,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 172 transitions, 659 flow. Second operand has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 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-12-05 21:15:05,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:05,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 145 [2023-12-05 21:15:05,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:05,888 INFO L124 PetriNetUnfolderBase]: 292/1180 cut-off events. [2023-12-05 21:15:05,889 INFO L125 PetriNetUnfolderBase]: For 787/792 co-relation queries the response was YES. [2023-12-05 21:15:05,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1180 events. 292/1180 cut-off events. For 787/792 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7689 event pairs, 14 based on Foata normal form. 74/1172 useless extension candidates. Maximal degree in co-relation 2720. Up to 461 conditions per place. [2023-12-05 21:15:05,894 INFO L140 encePairwiseOnDemand]: 131/145 looper letters, 101 selfloop transitions, 13 changer transitions 12/210 dead transitions. [2023-12-05 21:15:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 210 transitions, 1111 flow [2023-12-05 21:15:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:15:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:15:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 803 transitions. [2023-12-05 21:15:05,900 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6922413793103448 [2023-12-05 21:15:05,900 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 803 transitions. [2023-12-05 21:15:05,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 803 transitions. [2023-12-05 21:15:05,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:05,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 803 transitions. [2023-12-05 21:15:05,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.375) internal successors, (803), 8 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 145.0) internal successors, (1305), 9 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,904 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 145.0) internal successors, (1305), 9 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:05,905 INFO L308 CegarLoopForPetriNet]: 135 programPoint places, 6 predicate places. [2023-12-05 21:15:05,905 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 210 transitions, 1111 flow [2023-12-05 21:15:05,905 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 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-12-05 21:15:05,905 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:05,906 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,906 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:15:05,906 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:15:05,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash -154961731, now seen corresponding path program 1 times [2023-12-05 21:15:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480872094] [2023-12-05 21:15:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:06,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480872094] [2023-12-05 21:15:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480872094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:06,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:15:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050063353] [2023-12-05 21:15:06,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:06,128 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:15:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:15:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:15:06,130 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 145 [2023-12-05 21:15:06,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 210 transitions, 1111 flow. Second operand has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 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-12-05 21:15:06,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:06,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 145 [2023-12-05 21:15:06,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:06,331 INFO L124 PetriNetUnfolderBase]: 203/878 cut-off events. [2023-12-05 21:15:06,331 INFO L125 PetriNetUnfolderBase]: For 1304/1315 co-relation queries the response was YES. [2023-12-05 21:15:06,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 878 events. 203/878 cut-off events. For 1304/1315 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5190 event pairs, 10 based on Foata normal form. 104/921 useless extension candidates. Maximal degree in co-relation 2401. Up to 316 conditions per place. [2023-12-05 21:15:06,335 INFO L140 encePairwiseOnDemand]: 135/145 looper letters, 68 selfloop transitions, 8 changer transitions 28/188 dead transitions. [2023-12-05 21:15:06,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 188 transitions, 1191 flow [2023-12-05 21:15:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:15:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:15:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 671 transitions. [2023-12-05 21:15:06,338 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6610837438423646 [2023-12-05 21:15:06,338 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 671 transitions. [2023-12-05 21:15:06,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 671 transitions. [2023-12-05 21:15:06,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:06,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 671 transitions. [2023-12-05 21:15:06,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,342 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,343 INFO L308 CegarLoopForPetriNet]: 135 programPoint places, 7 predicate places. [2023-12-05 21:15:06,343 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 188 transitions, 1191 flow [2023-12-05 21:15:06,344 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.28571428571429) internal successors, (611), 7 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-12-05 21:15:06,344 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:06,344 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:06,344 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:15:06,345 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:15:06,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2145560694, now seen corresponding path program 1 times [2023-12-05 21:15:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444288973] [2023-12-05 21:15:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444288973] [2023-12-05 21:15:06,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444288973] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:06,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713322247] [2023-12-05 21:15:06,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:06,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:06,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:06,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:15:06,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:15:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:06,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:15:06,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:06,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:15:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:06,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:06,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713322247] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:06,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:06,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:15:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340490945] [2023-12-05 21:15:06,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:06,826 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:15:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:15:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:15:06,829 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 145 [2023-12-05 21:15:06,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 188 transitions, 1191 flow. Second operand has 14 states, 14 states have (on average 89.57142857142857) internal successors, (1254), 14 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:06,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 145 [2023-12-05 21:15:06,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:06,950 INFO L124 PetriNetUnfolderBase]: 51/217 cut-off events. [2023-12-05 21:15:06,950 INFO L125 PetriNetUnfolderBase]: For 558/560 co-relation queries the response was YES. [2023-12-05 21:15:06,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 217 events. 51/217 cut-off events. For 558/560 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 701 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 605. Up to 75 conditions per place. [2023-12-05 21:15:06,952 INFO L140 encePairwiseOnDemand]: 138/145 looper letters, 52 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2023-12-05 21:15:06,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 111 transitions, 776 flow [2023-12-05 21:15:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:15:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:15:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 667 transitions. [2023-12-05 21:15:06,953 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2023-12-05 21:15:06,953 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 667 transitions. [2023-12-05 21:15:06,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 667 transitions. [2023-12-05 21:15:06,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:06,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 667 transitions. [2023-12-05 21:15:06,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,956 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,957 INFO L308 CegarLoopForPetriNet]: 135 programPoint places, -34 predicate places. [2023-12-05 21:15:06,957 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 776 flow [2023-12-05 21:15:06,958 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 89.57142857142857) internal successors, (1254), 14 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:06,958 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:06,958 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:06,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:07,164 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:07,165 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-05 21:15:07,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2087871706, now seen corresponding path program 1 times [2023-12-05 21:15:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:07,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350585174] [2023-12-05 21:15:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:07,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:07,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:07,194 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:07,194 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2023-12-05 21:15:07,196 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2023-12-05 21:15:07,197 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2023-12-05 21:15:07,198 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2023-12-05 21:15:07,198 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2023-12-05 21:15:07,198 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2023-12-05 21:15:07,198 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:15:07,198 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-05 21:15:07,200 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:07,200 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:15:07,216 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:15:07,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 191 transitions, 398 flow [2023-12-05 21:15:07,236 INFO L124 PetriNetUnfolderBase]: 34/323 cut-off events. [2023-12-05 21:15:07,236 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:15:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 323 events. 34/323 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1223 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 199. Up to 8 conditions per place. [2023-12-05 21:15:07,237 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 191 transitions, 398 flow [2023-12-05 21:15:07,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 191 transitions, 398 flow [2023-12-05 21:15:07,240 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:07,240 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;@22b46087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:07,241 INFO L363 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-12-05 21:15:07,242 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:07,243 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2023-12-05 21:15:07,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:07,243 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:07,243 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:07,243 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:07,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash -826005410, now seen corresponding path program 1 times [2023-12-05 21:15:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494319180] [2023-12-05 21:15:07,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494319180] [2023-12-05 21:15:07,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494319180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:07,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:07,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:07,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311125330] [2023-12-05 21:15:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:07,266 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:07,267 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 191 [2023-12-05 21:15:07,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 191 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:07,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:07,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 191 [2023-12-05 21:15:07,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:08,600 INFO L124 PetriNetUnfolderBase]: 5995/14702 cut-off events. [2023-12-05 21:15:08,601 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-12-05 21:15:08,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24265 conditions, 14702 events. 5995/14702 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 150094 event pairs, 4606 based on Foata normal form. 2946/14917 useless extension candidates. Maximal degree in co-relation 1950. Up to 7347 conditions per place. [2023-12-05 21:15:08,673 INFO L140 encePairwiseOnDemand]: 169/191 looper letters, 79 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2023-12-05 21:15:08,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 196 transitions, 570 flow [2023-12-05 21:15:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2023-12-05 21:15:08,674 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8097731239092496 [2023-12-05 21:15:08,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2023-12-05 21:15:08,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2023-12-05 21:15:08,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:08,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2023-12-05 21:15:08,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:08,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:08,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:08,677 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, -3 predicate places. [2023-12-05 21:15:08,677 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 570 flow [2023-12-05 21:15:08,677 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:08,677 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:08,677 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:08,678 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:15:08,678 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:08,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -826005409, now seen corresponding path program 1 times [2023-12-05 21:15:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751488207] [2023-12-05 21:15:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:08,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751488207] [2023-12-05 21:15:08,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751488207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:08,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:08,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:08,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649646682] [2023-12-05 21:15:08,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:08,721 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:08,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:08,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:08,722 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 191 [2023-12-05 21:15:08,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 196 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:08,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:08,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 191 [2023-12-05 21:15:08,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:11,126 INFO L124 PetriNetUnfolderBase]: 12977/29090 cut-off events. [2023-12-05 21:15:11,126 INFO L125 PetriNetUnfolderBase]: For 7430/7984 co-relation queries the response was YES. [2023-12-05 21:15:11,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63091 conditions, 29090 events. 12977/29090 cut-off events. For 7430/7984 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 305743 event pairs, 6239 based on Foata normal form. 0/26001 useless extension candidates. Maximal degree in co-relation 6848. Up to 15804 conditions per place. [2023-12-05 21:15:11,286 INFO L140 encePairwiseOnDemand]: 185/191 looper letters, 120 selfloop transitions, 4 changer transitions 0/242 dead transitions. [2023-12-05 21:15:11,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 242 transitions, 972 flow [2023-12-05 21:15:11,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:15:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:15:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-12-05 21:15:11,288 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.725130890052356 [2023-12-05 21:15:11,288 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-12-05 21:15:11,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-12-05 21:15:11,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:11,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-12-05 21:15:11,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:11,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:11,290 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:11,291 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2023-12-05 21:15:11,291 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 242 transitions, 972 flow [2023-12-05 21:15:11,291 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:11,291 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:11,291 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:11,292 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:15:11,292 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:11,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 259801544, now seen corresponding path program 1 times [2023-12-05 21:15:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993085838] [2023-12-05 21:15:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:11,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993085838] [2023-12-05 21:15:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993085838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:11,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:11,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:15:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565340058] [2023-12-05 21:15:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:11,370 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:15:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:15:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:15:11,371 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 191 [2023-12-05 21:15:11,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 242 transitions, 972 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:11,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:11,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 191 [2023-12-05 21:15:11,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:13,788 INFO L124 PetriNetUnfolderBase]: 12787/27607 cut-off events. [2023-12-05 21:15:13,788 INFO L125 PetriNetUnfolderBase]: For 21145/21942 co-relation queries the response was YES. [2023-12-05 21:15:13,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78135 conditions, 27607 events. 12787/27607 cut-off events. For 21145/21942 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 279639 event pairs, 4181 based on Foata normal form. 1619/27840 useless extension candidates. Maximal degree in co-relation 8619. Up to 14712 conditions per place. [2023-12-05 21:15:13,944 INFO L140 encePairwiseOnDemand]: 177/191 looper letters, 205 selfloop transitions, 15 changer transitions 0/333 dead transitions. [2023-12-05 21:15:13,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 333 transitions, 1886 flow [2023-12-05 21:15:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:15:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:15:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1081 transitions. [2023-12-05 21:15:13,946 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7074607329842932 [2023-12-05 21:15:13,946 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1081 transitions. [2023-12-05 21:15:13,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1081 transitions. [2023-12-05 21:15:13,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:13,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1081 transitions. [2023-12-05 21:15:13,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.125) internal successors, (1081), 8 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:13,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:13,950 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 191.0) internal successors, (1719), 9 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:13,951 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, 6 predicate places. [2023-12-05 21:15:13,951 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 333 transitions, 1886 flow [2023-12-05 21:15:13,951 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:13,951 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:13,951 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:13,951 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:15:13,951 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:13,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 259801545, now seen corresponding path program 1 times [2023-12-05 21:15:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222179510] [2023-12-05 21:15:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222179510] [2023-12-05 21:15:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222179510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:15:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607792337] [2023-12-05 21:15:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:14,076 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:15:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:15:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:15:14,077 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 191 [2023-12-05 21:15:14,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 333 transitions, 1886 flow. Second operand has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 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-12-05 21:15:14,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:14,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 191 [2023-12-05 21:15:14,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:16,143 INFO L124 PetriNetUnfolderBase]: 9150/20553 cut-off events. [2023-12-05 21:15:16,144 INFO L125 PetriNetUnfolderBase]: For 28422/29927 co-relation queries the response was YES. [2023-12-05 21:15:16,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71559 conditions, 20553 events. 9150/20553 cut-off events. For 28422/29927 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 202094 event pairs, 2914 based on Foata normal form. 2151/21604 useless extension candidates. Maximal degree in co-relation 9797. Up to 10279 conditions per place. [2023-12-05 21:15:16,301 INFO L140 encePairwiseOnDemand]: 181/191 looper letters, 229 selfloop transitions, 9 changer transitions 6/349 dead transitions. [2023-12-05 21:15:16,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 349 transitions, 2494 flow [2023-12-05 21:15:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:15:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:15:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-12-05 21:15:16,303 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6611817501869858 [2023-12-05 21:15:16,303 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-12-05 21:15:16,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-12-05 21:15:16,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:16,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-12-05 21:15:16,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:16,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:16,308 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:16,309 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, 7 predicate places. [2023-12-05 21:15:16,309 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 349 transitions, 2494 flow [2023-12-05 21:15:16,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 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-12-05 21:15:16,309 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:16,309 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:16,309 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:15:16,309 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:16,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2122166461, now seen corresponding path program 1 times [2023-12-05 21:15:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885028544] [2023-12-05 21:15:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885028544] [2023-12-05 21:15:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885028544] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949020241] [2023-12-05 21:15:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:16,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:16,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:15:16,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:15:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:16,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:15:16,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:16,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:15:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:16,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949020241] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:16,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-05 21:15:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789698110] [2023-12-05 21:15:16,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:16,643 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 21:15:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 21:15:16,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-12-05 21:15:16,645 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 191 [2023-12-05 21:15:16,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 349 transitions, 2494 flow. Second operand has 14 states, 14 states have (on average 113.57142857142857) internal successors, (1590), 14 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:16,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:16,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 191 [2023-12-05 21:15:16,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:17,379 INFO L124 PetriNetUnfolderBase]: 2434/5135 cut-off events. [2023-12-05 21:15:17,379 INFO L125 PetriNetUnfolderBase]: For 17441/19085 co-relation queries the response was YES. [2023-12-05 21:15:17,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20831 conditions, 5135 events. 2434/5135 cut-off events. For 17441/19085 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 40447 event pairs, 55 based on Foata normal form. 2/4968 useless extension candidates. Maximal degree in co-relation 3050. Up to 3424 conditions per place. [2023-12-05 21:15:17,412 INFO L140 encePairwiseOnDemand]: 184/191 looper letters, 199 selfloop transitions, 8 changer transitions 0/290 dead transitions. [2023-12-05 21:15:17,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 290 transitions, 2547 flow [2023-12-05 21:15:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:15:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:15:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1262 transitions. [2023-12-05 21:15:17,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6607329842931937 [2023-12-05 21:15:17,415 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1262 transitions. [2023-12-05 21:15:17,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1262 transitions. [2023-12-05 21:15:17,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:17,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1262 transitions. [2023-12-05 21:15:17,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.2) internal successors, (1262), 10 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:17,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:17,419 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:17,420 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, -31 predicate places. [2023-12-05 21:15:17,420 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 290 transitions, 2547 flow [2023-12-05 21:15:17,420 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 113.57142857142857) internal successors, (1590), 14 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:17,420 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:17,421 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:17,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:17,625 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,SelfDestructingSolverStorable10 [2023-12-05 21:15:17,625 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:17,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1961654229, now seen corresponding path program 1 times [2023-12-05 21:15:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450191970] [2023-12-05 21:15:17,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:17,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450191970] [2023-12-05 21:15:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450191970] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250390738] [2023-12-05 21:15:17,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:17,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:17,736 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-12-05 21:15:17,739 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-12-05 21:15:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:17,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-05 21:15:17,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:17,863 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-05 21:15:17,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-05 21:15:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-05 21:15:17,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-05 21:15:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250390738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:15:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-05 21:15:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986428859] [2023-12-05 21:15:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:17,926 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:15:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:15:17,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:15:17,927 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 191 [2023-12-05 21:15:17,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 290 transitions, 2547 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:17,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:17,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 191 [2023-12-05 21:15:17,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:18,322 INFO L124 PetriNetUnfolderBase]: 1971/4100 cut-off events. [2023-12-05 21:15:18,322 INFO L125 PetriNetUnfolderBase]: For 21244/21746 co-relation queries the response was YES. [2023-12-05 21:15:18,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19179 conditions, 4100 events. 1971/4100 cut-off events. For 21244/21746 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 30028 event pairs, 0 based on Foata normal form. 144/4243 useless extension candidates. Maximal degree in co-relation 1626. Up to 2893 conditions per place. [2023-12-05 21:15:18,353 INFO L140 encePairwiseOnDemand]: 184/191 looper letters, 241 selfloop transitions, 4 changer transitions 0/325 dead transitions. [2023-12-05 21:15:18,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 325 transitions, 3483 flow [2023-12-05 21:15:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:15:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:15:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-12-05 21:15:18,355 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6481675392670158 [2023-12-05 21:15:18,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-12-05 21:15:18,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-12-05 21:15:18,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:18,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-12-05 21:15:18,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:18,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:18,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:18,358 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, -31 predicate places. [2023-12-05 21:15:18,358 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 325 transitions, 3483 flow [2023-12-05 21:15:18,359 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:18,359 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:18,359 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:18,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:18,565 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:18,566 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:18,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1961654228, now seen corresponding path program 1 times [2023-12-05 21:15:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:18,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818662693] [2023-12-05 21:15:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-05 21:15:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818662693] [2023-12-05 21:15:18,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818662693] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:18,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974864972] [2023-12-05 21:15:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:18,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:18,691 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-12-05 21:15:18,693 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-12-05 21:15:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:18,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-05 21:15:18,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:18,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-05 21:15:18,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-05 21:15:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-05 21:15:18,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-05 21:15:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974864972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:18,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-05 21:15:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-12-05 21:15:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005529434] [2023-12-05 21:15:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:18,977 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:15:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:18,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:15:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:15:18,978 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 191 [2023-12-05 21:15:18,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 325 transitions, 3483 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:18,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:18,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 191 [2023-12-05 21:15:18,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:19,452 INFO L124 PetriNetUnfolderBase]: 1484/3682 cut-off events. [2023-12-05 21:15:19,453 INFO L125 PetriNetUnfolderBase]: For 24188/24979 co-relation queries the response was YES. [2023-12-05 21:15:19,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17334 conditions, 3682 events. 1484/3682 cut-off events. For 24188/24979 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 28210 event pairs, 88 based on Foata normal form. 444/4114 useless extension candidates. Maximal degree in co-relation 2324. Up to 2170 conditions per place. [2023-12-05 21:15:19,477 INFO L140 encePairwiseOnDemand]: 184/191 looper letters, 209 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2023-12-05 21:15:19,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 293 transitions, 3589 flow [2023-12-05 21:15:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 21:15:19,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 21:15:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-12-05 21:15:19,479 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.612565445026178 [2023-12-05 21:15:19,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-12-05 21:15:19,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-12-05 21:15:19,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:19,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-12-05 21:15:19,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:19,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:19,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:19,482 INFO L308 CegarLoopForPetriNet]: 176 programPoint places, -31 predicate places. [2023-12-05 21:15:19,482 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 293 transitions, 3589 flow [2023-12-05 21:15:19,483 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:19,483 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:19,483 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:19,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-05 21:15:19,687 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:19,687 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-12-05 21:15:19,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1948693279, now seen corresponding path program 1 times [2023-12-05 21:15:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843358367] [2023-12-05 21:15:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:19,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:19,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:19,717 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2023-12-05 21:15:19,717 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2023-12-05 21:15:19,718 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2023-12-05 21:15:19,718 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2023-12-05 21:15:19,719 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2023-12-05 21:15:19,720 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2023-12-05 21:15:19,720 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2023-12-05 21:15:19,720 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2023-12-05 21:15:19,720 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2023-12-05 21:15:19,720 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2023-12-05 21:15:19,720 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2023-12-05 21:15:19,720 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:15:19,720 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:19,721 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:19,721 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:15:19,749 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:15:19,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 217 places, 237 transitions, 501 flow [2023-12-05 21:15:19,786 INFO L124 PetriNetUnfolderBase]: 54/488 cut-off events. [2023-12-05 21:15:19,787 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:15:19,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 513 conditions, 488 events. 54/488 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2039 event pairs, 1 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 331. Up to 16 conditions per place. [2023-12-05 21:15:19,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 237 transitions, 501 flow [2023-12-05 21:15:19,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 237 transitions, 501 flow [2023-12-05 21:15:19,796 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:19,797 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;@22b46087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:19,797 INFO L363 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-12-05 21:15:19,798 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:19,798 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-12-05 21:15:19,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:19,799 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:19,799 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:19,799 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:15:19,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash 583669963, now seen corresponding path program 1 times [2023-12-05 21:15:19,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:19,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783887069] [2023-12-05 21:15:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:19,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783887069] [2023-12-05 21:15:19,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783887069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:19,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:19,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274255974] [2023-12-05 21:15:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:19,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:19,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:19,821 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 237 [2023-12-05 21:15:19,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 237 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:19,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:19,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 237 [2023-12-05 21:15:19,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:47,120 INFO L124 PetriNetUnfolderBase]: 141380/275562 cut-off events. [2023-12-05 21:15:47,121 INFO L125 PetriNetUnfolderBase]: For 4141/4141 co-relation queries the response was YES. [2023-12-05 21:15:48,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472397 conditions, 275562 events. 141380/275562 cut-off events. For 4141/4141 co-relation queries the response was YES. Maximal size of possible extension queue 7026. Compared 3415700 event pairs, 108403 based on Foata normal form. 59160/278777 useless extension candidates. Maximal degree in co-relation 24246. Up to 150340 conditions per place. [2023-12-05 21:15:50,067 INFO L140 encePairwiseOnDemand]: 209/237 looper letters, 109 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2023-12-05 21:15:50,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 250 transitions, 749 flow [2023-12-05 21:15:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions. [2023-12-05 21:15:50,069 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8129395218002813 [2023-12-05 21:15:50,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 578 transitions. [2023-12-05 21:15:50,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions. [2023-12-05 21:15:50,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:50,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions. [2023-12-05 21:15:50,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:50,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:50,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:50,071 INFO L308 CegarLoopForPetriNet]: 217 programPoint places, -3 predicate places. [2023-12-05 21:15:50,071 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 250 transitions, 749 flow [2023-12-05 21:15:50,072 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:50,072 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:50,072 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:50,072 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:15:50,072 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-12-05 21:15:50,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash 583669964, now seen corresponding path program 1 times [2023-12-05 21:15:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:50,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238613316] [2023-12-05 21:15:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:50,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:15:50,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238613316] [2023-12-05 21:15:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238613316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:50,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:15:50,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643910670] [2023-12-05 21:15:50,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:50,115 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:15:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:15:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:15:50,116 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 237 [2023-12-05 21:15:50,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 250 transitions, 749 flow. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:15:50,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:50,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 237 [2023-12-05 21:15:50,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand