/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/weaver/test-easy10.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:21:17,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:21:17,470 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:21:17,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:21:17,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:21:17,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:21:17,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:21:17,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:21:17,495 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:21:17,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:21:17,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:21:17,495 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:21:17,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:21:17,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:21:17,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:21:17,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:21:17,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:21:17,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:21:17,497 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:21:17,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:21:17,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:21:17,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:21:17,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:21:17,499 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:21:17,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:21:17,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:21:17,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:21:17,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:21:17,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:21:17,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:21:17,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:21:17,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:21:17,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:21:17,501 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:21:17,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:21:17,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:21:17,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:21:17,750 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:21:17,753 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:21:17,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c [2023-12-05 21:21:18,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:21:18,982 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:21:18,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy10.wvr.c [2023-12-05 21:21:18,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eab3d91/6cc418a73f8c43f2ae52acf0253ddd5e/FLAG81e70e4e3 [2023-12-05 21:21:19,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86eab3d91/6cc418a73f8c43f2ae52acf0253ddd5e [2023-12-05 21:21:19,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:21:19,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:21:19,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:21:19,012 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:21:19,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:21:19,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dccaf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19, skipping insertion in model container [2023-12-05 21:21:19,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,036 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:21:19,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:21:19,194 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:21:19,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:21:19,218 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:21:19,219 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:21:19,224 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:21:19,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19 WrapperNode [2023-12-05 21:21:19,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:21:19,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:21:19,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:21:19,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:21:19,230 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:21:19" (1/1) ... [2023-12-05 21:21:19,241 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:21:19" (1/1) ... [2023-12-05 21:21:19,288 INFO L138 Inliner]: procedures = 23, calls = 85, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 197 [2023-12-05 21:21:19,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:21:19,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:21:19,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:21:19,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:21:19,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:21:19,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:21:19,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:21:19,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:21:19,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (1/1) ... [2023-12-05 21:21:19,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:21:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:21:19,338 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:21:19,343 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:21:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:21:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:21:19,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:21:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:21:19,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:21:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:21:19,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:21:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-05 21:21:19,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-05 21:21:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:21:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:21:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:21:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:21:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:21:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:21:19,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:21:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:21:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:21:19,363 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:21:19,436 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:21:19,437 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:21:19,714 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:21:19,773 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:21:19,774 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:21:19,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:21:19 BoogieIcfgContainer [2023-12-05 21:21:19,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:21:19,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:21:19,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:21:19,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:21:19,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:21:19" (1/3) ... [2023-12-05 21:21:19,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457ba6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:21:19, skipping insertion in model container [2023-12-05 21:21:19,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:21:19" (2/3) ... [2023-12-05 21:21:19,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@457ba6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:21:19, skipping insertion in model container [2023-12-05 21:21:19,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:21:19" (3/3) ... [2023-12-05 21:21:19,782 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2023-12-05 21:21:19,794 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:21:19,794 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 21:21:19,795 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:21:19,845 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:21:19,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 160 transitions, 348 flow [2023-12-05 21:21:19,935 INFO L124 PetriNetUnfolderBase]: 2/156 cut-off events. [2023-12-05 21:21:19,935 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-05 21:21:19,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 156 events. 2/156 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 145 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-12-05 21:21:19,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 160 transitions, 348 flow [2023-12-05 21:21:19,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 129 transitions, 279 flow [2023-12-05 21:21:19,948 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:21:19,959 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;@418476ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:21:19,959 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-12-05 21:21:19,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:21:19,967 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:21:19,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:21:19,968 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:19,968 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] [2023-12-05 21:21:19,969 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:19,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1125948638, now seen corresponding path program 1 times [2023-12-05 21:21:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:19,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75277221] [2023-12-05 21:21:19,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:21:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75277221] [2023-12-05 21:21:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75277221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704429399] [2023-12-05 21:21:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:20,436 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:20,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:20,462 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:21:20,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 129 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:21:20,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:20,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:21:20,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:20,607 INFO L124 PetriNetUnfolderBase]: 182/574 cut-off events. [2023-12-05 21:21:20,608 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:21:20,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 574 events. 182/574 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2925 event pairs, 182 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 657. Up to 318 conditions per place. [2023-12-05 21:21:20,616 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 33 selfloop transitions, 1 changer transitions 1/126 dead transitions. [2023-12-05 21:21:20,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 126 transitions, 341 flow [2023-12-05 21:21:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-12-05 21:21:20,630 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7833333333333333 [2023-12-05 21:21:20,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-12-05 21:21:20,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-12-05 21:21:20,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:20,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-12-05 21:21:20,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:21:20,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:20,643 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:20,647 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:20,648 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 126 transitions, 341 flow [2023-12-05 21:21:20,648 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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:21:20,648 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:20,649 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] [2023-12-05 21:21:20,649 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:21:20,649 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:20,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1125948637, now seen corresponding path program 1 times [2023-12-05 21:21:20,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:20,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769973676] [2023-12-05 21:21:20,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:20,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:20,950 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:21:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769973676] [2023-12-05 21:21:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769973676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:21:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260382846] [2023-12-05 21:21:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:20,969 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:21:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:20,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:21:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:21:20,971 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 160 [2023-12-05 21:21:20,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 126 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:21:20,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:20,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 160 [2023-12-05 21:21:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:21,092 INFO L124 PetriNetUnfolderBase]: 184/574 cut-off events. [2023-12-05 21:21:21,093 INFO L125 PetriNetUnfolderBase]: For 105/121 co-relation queries the response was YES. [2023-12-05 21:21:21,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 574 events. 184/574 cut-off events. For 105/121 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2900 event pairs, 184 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 814. Up to 331 conditions per place. [2023-12-05 21:21:21,098 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 37 selfloop transitions, 1 changer transitions 1/124 dead transitions. [2023-12-05 21:21:21,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 124 transitions, 409 flow [2023-12-05 21:21:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-12-05 21:21:21,100 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7520833333333333 [2023-12-05 21:21:21,100 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-12-05 21:21:21,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-12-05 21:21:21,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:21,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-12-05 21:21:21,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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:21:21,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,103 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:21,104 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 124 transitions, 409 flow [2023-12-05 21:21:21,104 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:21:21,104 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:21,104 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, 1] [2023-12-05 21:21:21,104 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:21:21,105 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:21,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 356209841, now seen corresponding path program 1 times [2023-12-05 21:21:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918004959] [2023-12-05 21:21:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:21,223 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:21:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918004959] [2023-12-05 21:21:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918004959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:21,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913455964] [2023-12-05 21:21:21,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:21,228 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:21,230 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:21:21,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 124 transitions, 409 flow. Second operand has 3 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:21:21,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:21,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:21:21,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:21,346 INFO L124 PetriNetUnfolderBase]: 171/551 cut-off events. [2023-12-05 21:21:21,346 INFO L125 PetriNetUnfolderBase]: For 266/298 co-relation queries the response was YES. [2023-12-05 21:21:21,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 551 events. 171/551 cut-off events. For 266/298 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2761 event pairs, 171 based on Foata normal form. 0/526 useless extension candidates. Maximal degree in co-relation 994. Up to 308 conditions per place. [2023-12-05 21:21:21,350 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 31 selfloop transitions, 1 changer transitions 1/122 dead transitions. [2023-12-05 21:21:21,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 122 transitions, 461 flow [2023-12-05 21:21:21,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-12-05 21:21:21,351 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7770833333333333 [2023-12-05 21:21:21,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-12-05 21:21:21,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-12-05 21:21:21,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:21,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-12-05 21:21:21,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:21:21,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,354 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:21,355 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 122 transitions, 461 flow [2023-12-05 21:21:21,355 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:21:21,355 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:21,355 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, 1] [2023-12-05 21:21:21,355 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:21:21,355 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:21,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash 356209842, now seen corresponding path program 1 times [2023-12-05 21:21:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242348044] [2023-12-05 21:21:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:21,489 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:21:21,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:21,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242348044] [2023-12-05 21:21:21,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242348044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:21,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:21,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:21:21,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804961704] [2023-12-05 21:21:21,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:21,490 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:21:21,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:21,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:21:21,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:21:21,494 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 160 [2023-12-05 21:21:21,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 122 transitions, 461 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:21:21,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:21,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 160 [2023-12-05 21:21:21,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:21,597 INFO L124 PetriNetUnfolderBase]: 158/528 cut-off events. [2023-12-05 21:21:21,598 INFO L125 PetriNetUnfolderBase]: For 451/499 co-relation queries the response was YES. [2023-12-05 21:21:21,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 528 events. 158/528 cut-off events. For 451/499 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2609 event pairs, 158 based on Foata normal form. 10/513 useless extension candidates. Maximal degree in co-relation 1182. Up to 285 conditions per place. [2023-12-05 21:21:21,603 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 33 selfloop transitions, 1 changer transitions 1/120 dead transitions. [2023-12-05 21:21:21,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 120 transitions, 517 flow [2023-12-05 21:21:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:21:21,605 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.74375 [2023-12-05 21:21:21,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:21:21,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:21:21,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:21,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:21:21,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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:21:21,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,609 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:21,609 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 120 transitions, 517 flow [2023-12-05 21:21:21,609 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:21:21,609 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:21,610 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:21:21,610 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:21:21,610 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:21,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -559555727, now seen corresponding path program 1 times [2023-12-05 21:21:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248708761] [2023-12-05 21:21:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:21,732 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:21:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248708761] [2023-12-05 21:21:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248708761] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236430778] [2023-12-05 21:21:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:21,734 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:21,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:21,735 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 160 [2023-12-05 21:21:21,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 120 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:21:21,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:21,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 160 [2023-12-05 21:21:21,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:21,824 INFO L124 PetriNetUnfolderBase]: 150/504 cut-off events. [2023-12-05 21:21:21,824 INFO L125 PetriNetUnfolderBase]: For 680/744 co-relation queries the response was YES. [2023-12-05 21:21:21,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 504 events. 150/504 cut-off events. For 680/744 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2482 event pairs, 150 based on Foata normal form. 8/495 useless extension candidates. Maximal degree in co-relation 1324. Up to 269 conditions per place. [2023-12-05 21:21:21,829 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 28 selfloop transitions, 1 changer transitions 1/118 dead transitions. [2023-12-05 21:21:21,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 118 transitions, 563 flow [2023-12-05 21:21:21,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-12-05 21:21:21,830 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7958333333333333 [2023-12-05 21:21:21,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-12-05 21:21:21,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-12-05 21:21:21,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:21,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-12-05 21:21:21,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:21:21,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:21,836 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:21,836 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 118 transitions, 563 flow [2023-12-05 21:21:21,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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:21:21,837 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:21,837 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:21:21,840 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:21:21,840 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:21,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash -559555728, now seen corresponding path program 1 times [2023-12-05 21:21:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451274760] [2023-12-05 21:21:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:21,932 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:21:21,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451274760] [2023-12-05 21:21:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451274760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871544823] [2023-12-05 21:21:21,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:21,933 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:21,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:21,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:21,934 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:21:21,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 118 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:21:21,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:21,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:21:21,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:22,007 INFO L124 PetriNetUnfolderBase]: 142/480 cut-off events. [2023-12-05 21:21:22,007 INFO L125 PetriNetUnfolderBase]: For 995/1075 co-relation queries the response was YES. [2023-12-05 21:21:22,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 480 events. 142/480 cut-off events. For 995/1075 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2305 event pairs, 142 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 1442. Up to 253 conditions per place. [2023-12-05 21:21:22,012 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 27 selfloop transitions, 1 changer transitions 1/116 dead transitions. [2023-12-05 21:21:22,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 116 transitions, 595 flow [2023-12-05 21:21:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-12-05 21:21:22,013 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.76875 [2023-12-05 21:21:22,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-12-05 21:21:22,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-12-05 21:21:22,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:22,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-12-05 21:21:22,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:21:22,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:22,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:22,017 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:22,017 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 116 transitions, 595 flow [2023-12-05 21:21:22,018 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:21:22,018 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:22,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:21:22,018 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:21:22,019 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:22,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1809235848, now seen corresponding path program 1 times [2023-12-05 21:21:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905524811] [2023-12-05 21:21:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:22,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:22,104 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:21:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905524811] [2023-12-05 21:21:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905524811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18783739] [2023-12-05 21:21:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:22,108 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:22,110 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 160 [2023-12-05 21:21:22,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 116 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:21:22,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:22,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 160 [2023-12-05 21:21:22,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:22,193 INFO L124 PetriNetUnfolderBase]: 129/457 cut-off events. [2023-12-05 21:21:22,194 INFO L125 PetriNetUnfolderBase]: For 1289/1385 co-relation queries the response was YES. [2023-12-05 21:21:22,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 457 events. 129/457 cut-off events. For 1289/1385 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2148 event pairs, 129 based on Foata normal form. 10/458 useless extension candidates. Maximal degree in co-relation 1488. Up to 230 conditions per place. [2023-12-05 21:21:22,198 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 26 selfloop transitions, 1 changer transitions 1/114 dead transitions. [2023-12-05 21:21:22,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 114 transitions, 633 flow [2023-12-05 21:21:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-12-05 21:21:22,199 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-12-05 21:21:22,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-12-05 21:21:22,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-12-05 21:21:22,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:22,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-12-05 21:21:22,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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:21:22,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:22,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:22,204 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:22,204 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 114 transitions, 633 flow [2023-12-05 21:21:22,204 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:21:22,204 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:22,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:21:22,204 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:21:22,204 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 21:21:22,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1809235847, now seen corresponding path program 1 times [2023-12-05 21:21:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:22,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43333690] [2023-12-05 21:21:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:22,250 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:21:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43333690] [2023-12-05 21:21:22,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43333690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:22,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:22,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:22,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675426224] [2023-12-05 21:21:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:22,251 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:22,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:22,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:22,253 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 160 [2023-12-05 21:21:22,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 114 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:21:22,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:22,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 160 [2023-12-05 21:21:22,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:22,323 INFO L124 PetriNetUnfolderBase]: 116/434 cut-off events. [2023-12-05 21:21:22,323 INFO L125 PetriNetUnfolderBase]: For 1654/1766 co-relation queries the response was YES. [2023-12-05 21:21:22,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2177 conditions, 434 events. 116/434 cut-off events. For 1654/1766 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2012 event pairs, 116 based on Foata normal form. 10/435 useless extension candidates. Maximal degree in co-relation 1478. Up to 207 conditions per place. [2023-12-05 21:21:22,326 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 0 selfloop transitions, 0 changer transitions 112/112 dead transitions. [2023-12-05 21:21:22,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 112 transitions, 657 flow [2023-12-05 21:21:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:21:22,327 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7645833333333333 [2023-12-05 21:21:22,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:21:22,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:21:22,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:22,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:21:22,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:21:22,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:22,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:21:22,330 INFO L308 CegarLoopForPetriNet]: 141 programPoint places, 0 predicate places. [2023-12-05 21:21:22,330 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 112 transitions, 657 flow [2023-12-05 21:21:22,331 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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:21:22,336 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/test-easy10.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:21:22,369 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-12-05 21:21:22,370 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-12-05 21:21:22,371 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-12-05 21:21:22,372 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-12-05 21:21:22,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-12-05 21:21:22,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-12-05 21:21:22,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-12-05 21:21:22,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-12-05 21:21:22,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-12-05 21:21:22,373 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-12-05 21:21:22,373 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:21:22,374 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:21:22,376 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:21:22,376 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:21:22,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:21:22 BasicIcfg [2023-12-05 21:21:22,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:21:22,382 INFO L158 Benchmark]: Toolchain (without parser) took 3373.70ms. Allocated memory was 191.9MB in the beginning and 293.6MB in the end (delta: 101.7MB). Free memory was 125.7MB in the beginning and 168.3MB in the end (delta: -42.7MB). Peak memory consumption was 60.4MB. Max. memory is 8.0GB. [2023-12-05 21:21:22,382 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:21:22,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.85ms. Allocated memory is still 191.9MB. Free memory was 125.5MB in the beginning and 113.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-05 21:21:22,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.91ms. Allocated memory is still 191.9MB. Free memory was 113.5MB in the beginning and 158.3MB in the end (delta: -44.9MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2023-12-05 21:21:22,383 INFO L158 Benchmark]: Boogie Preprocessor took 19.02ms. Allocated memory is still 191.9MB. Free memory was 158.3MB in the beginning and 156.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:21:22,383 INFO L158 Benchmark]: RCFGBuilder took 467.47ms. Allocated memory is still 191.9MB. Free memory was 156.8MB in the beginning and 132.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:21:22,383 INFO L158 Benchmark]: TraceAbstraction took 2604.15ms. Allocated memory was 191.9MB in the beginning and 293.6MB in the end (delta: 101.7MB). Free memory was 132.1MB in the beginning and 168.3MB in the end (delta: -36.2MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. [2023-12-05 21:21:22,384 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.85ms. Allocated memory is still 191.9MB. Free memory was 125.5MB in the beginning and 113.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.91ms. Allocated memory is still 191.9MB. Free memory was 113.5MB in the beginning and 158.3MB in the end (delta: -44.9MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.02ms. Allocated memory is still 191.9MB. Free memory was 158.3MB in the beginning and 156.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 467.47ms. Allocated memory is still 191.9MB. Free memory was 156.8MB in the beginning and 132.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2604.15ms. Allocated memory was 191.9MB in the beginning and 293.6MB in the end (delta: 101.7MB). Free memory was 132.1MB in the beginning and 168.3MB in the end (delta: -36.2MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 203 locations, 20 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 50 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 1946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:21:22,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...