/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/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:20:17,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:20:17,531 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:20:17,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:20:17,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:20:17,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:20:17,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:20:17,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:20:17,560 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:20:17,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:20:17,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:20:17,564 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:20:17,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:20:17,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:20:17,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:20:17,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:20:17,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:20:17,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:20:17,566 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:20:17,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:20:17,566 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:20:17,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:20:17,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:20:17,567 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:20:17,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:20:17,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:20:17,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:20:17,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:20:17,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:20:17,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:20:17,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:20:17,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:20:17,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:20:17,569 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:20:17,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:20:17,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:20:17,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:20:17,744 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:20:17,744 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:20:17,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-12-05 21:20:18,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:20:19,062 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:20:19,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-12-05 21:20:19,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ef2dc63/e200fa0ae01245c8908655762d010d5f/FLAGe4ebe2c93 [2023-12-05 21:20:19,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ef2dc63/e200fa0ae01245c8908655762d010d5f [2023-12-05 21:20:19,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:20:19,082 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:20:19,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:20:19,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:20:19,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:20:19,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296d5164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19, skipping insertion in model container [2023-12-05 21:20:19,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:20:19,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:20:19,240 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:20:19,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:20:19,275 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:20:19,275 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:20:19,280 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:20:19,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19 WrapperNode [2023-12-05 21:20:19,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:20:19,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:20:19,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:20:19,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:20:19,288 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:20:19" (1/1) ... [2023-12-05 21:20:19,296 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:20:19" (1/1) ... [2023-12-05 21:20:19,323 INFO L138 Inliner]: procedures = 25, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 295 [2023-12-05 21:20:19,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:20:19,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:20:19,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:20:19,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:20:19,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:20:19,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:20:19,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:20:19,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:20:19,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (1/1) ... [2023-12-05 21:20:19,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:20:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:20:19,393 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:20:19,398 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:20:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:20:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:20:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:20:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:20:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 21:20:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 21:20:19,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 21:20:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 21:20:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 21:20:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 21:20:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-05 21:20:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-05 21:20:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:20:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-12-05 21:20:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-12-05 21:20:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-12-05 21:20:19,425 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-12-05 21:20:19,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:20:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:20:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:20:19,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:20:19,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:20:19,427 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:20:19,511 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:20:19,529 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:20:19,848 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:20:19,914 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:20:19,914 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:20:19,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:20:19 BoogieIcfgContainer [2023-12-05 21:20:19,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:20:19,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:20:19,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:20:19,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:20:19,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:20:19" (1/3) ... [2023-12-05 21:20:19,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47173d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:20:19, skipping insertion in model container [2023-12-05 21:20:19,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:20:19" (2/3) ... [2023-12-05 21:20:19,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47173d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:20:19, skipping insertion in model container [2023-12-05 21:20:19,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:20:19" (3/3) ... [2023-12-05 21:20:19,923 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-12-05 21:20:19,938 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:20:19,939 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-12-05 21:20:19,939 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:20:20,008 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-12-05 21:20:20,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 226 transitions, 494 flow [2023-12-05 21:20:20,149 INFO L124 PetriNetUnfolderBase]: 2/220 cut-off events. [2023-12-05 21:20:20,150 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:20:20,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 220 events. 2/220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 182 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 162. Up to 2 conditions per place. [2023-12-05 21:20:20,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 226 transitions, 494 flow [2023-12-05 21:20:20,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 189 transitions, 411 flow [2023-12-05 21:20:20,180 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:20:20,186 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;@19b5ff5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:20:20,186 INFO L363 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-12-05 21:20:20,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:20:20,198 INFO L124 PetriNetUnfolderBase]: 1/74 cut-off events. [2023-12-05 21:20:20,198 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:20:20,198 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:20,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:20,199 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:20:20,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1879166301, now seen corresponding path program 1 times [2023-12-05 21:20:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711719624] [2023-12-05 21:20:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:20,849 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:20:20,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711719624] [2023-12-05 21:20:20,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711719624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:20,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:20,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:20:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290044968] [2023-12-05 21:20:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:20,858 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:20:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:20:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:20:20,880 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 226 [2023-12-05 21:20:20,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 189 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:20,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:20,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 226 [2023-12-05 21:20:20,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:34,411 INFO L124 PetriNetUnfolderBase]: 79872/120548 cut-off events. [2023-12-05 21:20:34,412 INFO L125 PetriNetUnfolderBase]: For 3923/3923 co-relation queries the response was YES. [2023-12-05 21:20:35,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225002 conditions, 120548 events. 79872/120548 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 4263. Compared 993073 event pairs, 79872 based on Foata normal form. 1/113044 useless extension candidates. Maximal degree in co-relation 183968. Up to 100348 conditions per place. [2023-12-05 21:20:35,798 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 61 selfloop transitions, 1 changer transitions 1/186 dead transitions. [2023-12-05 21:20:35,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 186 transitions, 529 flow [2023-12-05 21:20:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-12-05 21:20:35,813 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7551622418879056 [2023-12-05 21:20:35,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-12-05 21:20:35,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-12-05 21:20:35,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:35,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-12-05 21:20:35,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:20:35,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:20:35,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:20:35,832 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2023-12-05 21:20:35,832 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 186 transitions, 529 flow [2023-12-05 21:20:35,833 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:20:35,833 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:35,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:35,833 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:20:35,834 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:20:35,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1879166302, now seen corresponding path program 1 times [2023-12-05 21:20:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314831030] [2023-12-05 21:20:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:35,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:36,207 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:20:36,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:36,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314831030] [2023-12-05 21:20:36,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314831030] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:36,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:20:36,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554631317] [2023-12-05 21:20:36,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:36,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:20:36,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:20:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:20:36,210 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-12-05 21:20:36,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 186 transitions, 529 flow. Second operand has 5 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 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:20:36,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:36,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-12-05 21:20:36,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:20:47,719 INFO L124 PetriNetUnfolderBase]: 70998/106552 cut-off events. [2023-12-05 21:20:47,720 INFO L125 PetriNetUnfolderBase]: For 18175/20223 co-relation queries the response was YES. [2023-12-05 21:20:48,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288145 conditions, 106552 events. 70998/106552 cut-off events. For 18175/20223 co-relation queries the response was YES. Maximal size of possible extension queue 3335. Compared 855152 event pairs, 70998 based on Foata normal form. 0/102462 useless extension candidates. Maximal degree in co-relation 212977. Up to 90105 conditions per place. [2023-12-05 21:20:48,865 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 69 selfloop transitions, 1 changer transitions 1/184 dead transitions. [2023-12-05 21:20:48,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 184 transitions, 661 flow [2023-12-05 21:20:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:20:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:20:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-12-05 21:20:48,868 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7212389380530974 [2023-12-05 21:20:48,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-12-05 21:20:48,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-12-05 21:20:48,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:20:48,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-12-05 21:20:48,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:20:48,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:20:48,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:20:48,875 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2023-12-05 21:20:48,875 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 184 transitions, 661 flow [2023-12-05 21:20:48,875 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 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:20:48,875 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:20:48,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:20:48,876 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:20:48,877 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:20:48,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:20:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1567383702, now seen corresponding path program 1 times [2023-12-05 21:20:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:20:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251250227] [2023-12-05 21:20:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:20:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:20:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:20:49,202 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:20:49,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:20:49,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251250227] [2023-12-05 21:20:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251250227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:20:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:20:49,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:20:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577525410] [2023-12-05 21:20:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:20:49,208 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:20:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:20:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:20:49,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:20:49,216 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-12-05 21:20:49,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 184 transitions, 661 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 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:20:49,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:20:49,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-12-05 21:20:49,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:00,939 INFO L124 PetriNetUnfolderBase]: 63312/96802 cut-off events. [2023-12-05 21:21:00,939 INFO L125 PetriNetUnfolderBase]: For 33101/39243 co-relation queries the response was YES. [2023-12-05 21:21:01,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340307 conditions, 96802 events. 63312/96802 cut-off events. For 33101/39243 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 794199 event pairs, 63312 based on Foata normal form. 1026/94768 useless extension candidates. Maximal degree in co-relation 278449. Up to 80363 conditions per place. [2023-12-05 21:21:02,173 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 65 selfloop transitions, 1 changer transitions 1/180 dead transitions. [2023-12-05 21:21:02,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 180 transitions, 773 flow [2023-12-05 21:21:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-12-05 21:21:02,175 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7182890855457227 [2023-12-05 21:21:02,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-12-05 21:21:02,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-12-05 21:21:02,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:02,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-12-05 21:21:02,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:02,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:02,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:02,178 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -2 predicate places. [2023-12-05 21:21:02,178 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 180 transitions, 773 flow [2023-12-05 21:21:02,178 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 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:02,178 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:02,179 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, 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:02,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:21:02,179 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:21:02,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:02,179 INFO L85 PathProgramCache]: Analyzing trace with hash 689864349, now seen corresponding path program 1 times [2023-12-05 21:21:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124905319] [2023-12-05 21:21:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:02,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:02,334 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:02,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124905319] [2023-12-05 21:21:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124905319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:02,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:02,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:21:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106235208] [2023-12-05 21:21:02,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:02,336 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:21:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:02,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:21:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:21:02,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-12-05 21:21:02,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 180 transitions, 773 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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:02,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:02,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-12-05 21:21:02,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:15,287 INFO L124 PetriNetUnfolderBase]: 61728/94650 cut-off events. [2023-12-05 21:21:15,287 INFO L125 PetriNetUnfolderBase]: For 58544/68768 co-relation queries the response was YES. [2023-12-05 21:21:15,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410283 conditions, 94650 events. 61728/94650 cut-off events. For 58544/68768 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 781710 event pairs, 61728 based on Foata normal form. 264/92134 useless extension candidates. Maximal degree in co-relation 343559. Up to 78235 conditions per place. [2023-12-05 21:21:16,459 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 61 selfloop transitions, 1 changer transitions 1/176 dead transitions. [2023-12-05 21:21:16,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 176 transitions, 869 flow [2023-12-05 21:21:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-12-05 21:21:16,460 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7123893805309734 [2023-12-05 21:21:16,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-12-05 21:21:16,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-12-05 21:21:16,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:16,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-12-05 21:21:16,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:16,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:16,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:16,464 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -4 predicate places. [2023-12-05 21:21:16,464 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 176 transitions, 869 flow [2023-12-05 21:21:16,464 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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:16,464 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:16,464 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, 1, 1, 1, 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:16,464 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:21:16,464 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:21:16,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1180841505, now seen corresponding path program 1 times [2023-12-05 21:21:16,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:16,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805037555] [2023-12-05 21:21:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:16,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:16,627 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:16,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:16,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805037555] [2023-12-05 21:21:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805037555] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:16,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:21:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330417577] [2023-12-05 21:21:16,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:16,628 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:21:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:16,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:21:16,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:21:16,630 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-12-05 21:21:16,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 176 transitions, 869 flow. Second operand has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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:16,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:16,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-12-05 21:21:16,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:29,350 INFO L124 PetriNetUnfolderBase]: 61152/93722 cut-off events. [2023-12-05 21:21:29,350 INFO L125 PetriNetUnfolderBase]: For 93244/107484 co-relation queries the response was YES. [2023-12-05 21:21:29,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483563 conditions, 93722 events. 61152/93722 cut-off events. For 93244/107484 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 774422 event pairs, 61152 based on Foata normal form. 96/91198 useless extension candidates. Maximal degree in co-relation 406469. Up to 77403 conditions per place. [2023-12-05 21:21:30,506 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 57 selfloop transitions, 1 changer transitions 1/172 dead transitions. [2023-12-05 21:21:30,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 172 transitions, 949 flow [2023-12-05 21:21:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-12-05 21:21:30,508 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7064896755162242 [2023-12-05 21:21:30,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-12-05 21:21:30,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-12-05 21:21:30,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:30,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-12-05 21:21:30,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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:30,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:30,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:30,512 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-12-05 21:21:30,512 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 172 transitions, 949 flow [2023-12-05 21:21:30,512 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 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:30,512 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:30,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,513 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:21:30,513 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:21:30,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash -167408325, now seen corresponding path program 1 times [2023-12-05 21:21:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:30,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876513182] [2023-12-05 21:21:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:30,581 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:30,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:30,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876513182] [2023-12-05 21:21:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876513182] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:30,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:30,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:30,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275613534] [2023-12-05 21:21:30,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:30,583 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:30,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:30,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:30,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:30,584 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 226 [2023-12-05 21:21:30,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 172 transitions, 949 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:30,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:30,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 226 [2023-12-05 21:21:30,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:43,439 INFO L124 PetriNetUnfolderBase]: 60360/92466 cut-off events. [2023-12-05 21:21:43,439 INFO L125 PetriNetUnfolderBase]: For 135253/151637 co-relation queries the response was YES. [2023-12-05 21:21:43,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552303 conditions, 92466 events. 60360/92466 cut-off events. For 135253/151637 co-relation queries the response was YES. Maximal size of possible extension queue 3324. Compared 762772 event pairs, 60360 based on Foata normal form. 0/90118 useless extension candidates. Maximal degree in co-relation 463107. Up to 76339 conditions per place. [2023-12-05 21:21:44,800 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 53 selfloop transitions, 1 changer transitions 1/170 dead transitions. [2023-12-05 21:21:44,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 170 transitions, 1033 flow [2023-12-05 21:21:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-12-05 21:21:44,801 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7418879056047197 [2023-12-05 21:21:44,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-12-05 21:21:44,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-12-05 21:21:44,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:44,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-12-05 21:21:44,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:21:44,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:44,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:44,807 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-12-05 21:21:44,807 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 170 transitions, 1033 flow [2023-12-05 21:21:44,807 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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:44,807 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:44,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,808 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:21:44,808 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:21:44,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:44,808 INFO L85 PathProgramCache]: Analyzing trace with hash -167408324, now seen corresponding path program 1 times [2023-12-05 21:21:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:44,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137275894] [2023-12-05 21:21:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:44,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:44,893 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:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137275894] [2023-12-05 21:21:44,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137275894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:44,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874120411] [2023-12-05 21:21:44,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:44,894 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:44,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:44,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:44,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:44,895 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 226 [2023-12-05 21:21:44,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 170 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:44,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:44,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 226 [2023-12-05 21:21:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:21:58,301 INFO L124 PetriNetUnfolderBase]: 59568/91210 cut-off events. [2023-12-05 21:21:58,302 INFO L125 PetriNetUnfolderBase]: For 198850/226882 co-relation queries the response was YES. [2023-12-05 21:21:58,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619186 conditions, 91210 events. 59568/91210 cut-off events. For 198850/226882 co-relation queries the response was YES. Maximal size of possible extension queue 3323. Compared 751087 event pairs, 59568 based on Foata normal form. 144/89646 useless extension candidates. Maximal degree in co-relation 517953. Up to 75275 conditions per place. [2023-12-05 21:21:59,451 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 50 selfloop transitions, 1 changer transitions 1/168 dead transitions. [2023-12-05 21:21:59,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 168 transitions, 1111 flow [2023-12-05 21:21:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:21:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:21:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-12-05 21:21:59,454 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7640117994100295 [2023-12-05 21:21:59,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-12-05 21:21:59,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-12-05 21:21:59,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:21:59,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-12-05 21:21:59,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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:59,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:59,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:59,479 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-12-05 21:21:59,479 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 168 transitions, 1111 flow [2023-12-05 21:21:59,479 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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:59,479 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:21:59,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,479 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:21:59,479 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:21:59,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:21:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash 81628621, now seen corresponding path program 1 times [2023-12-05 21:21:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:21:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097214581] [2023-12-05 21:21:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:21:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:21:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:21:59,627 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:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:21:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097214581] [2023-12-05 21:21:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097214581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:21:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:21:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:21:59,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013242324] [2023-12-05 21:21:59,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:21:59,628 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:21:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:21:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:21:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:21:59,629 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 226 [2023-12-05 21:21:59,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 168 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:59,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:21:59,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 226 [2023-12-05 21:21:59,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:22:12,620 INFO L124 PetriNetUnfolderBase]: 55725/85571 cut-off events. [2023-12-05 21:22:12,620 INFO L125 PetriNetUnfolderBase]: For 250106/281338 co-relation queries the response was YES. [2023-12-05 21:22:12,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651914 conditions, 85571 events. 55725/85571 cut-off events. For 250106/281338 co-relation queries the response was YES. Maximal size of possible extension queue 3069. Compared 698582 event pairs, 55725 based on Foata normal form. 516/84891 useless extension candidates. Maximal degree in co-relation 538431. Up to 70404 conditions per place. [2023-12-05 21:22:13,939 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 50 selfloop transitions, 1 changer transitions 1/166 dead transitions. [2023-12-05 21:22:13,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 166 transitions, 1189 flow [2023-12-05 21:22:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:22:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:22:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-12-05 21:22:13,941 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7640117994100295 [2023-12-05 21:22:13,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-12-05 21:22:13,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-12-05 21:22:13,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:22:13,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-12-05 21:22:13,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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:22:13,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:22:13,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:22:13,944 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-12-05 21:22:13,944 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 166 transitions, 1189 flow [2023-12-05 21:22:13,944 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:22:13,944 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:22:13,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,944 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:22:13,945 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-12-05 21:22:13,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:22:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 81628620, now seen corresponding path program 1 times [2023-12-05 21:22:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:22:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952726779] [2023-12-05 21:22:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:22:13,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:22:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:22:13,986 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:22:13,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:22:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952726779] [2023-12-05 21:22:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952726779] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:22:13,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:22:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:22:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42486712] [2023-12-05 21:22:13,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:22:13,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:22:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:22:13,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:22:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:22:13,988 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 226 [2023-12-05 21:22:13,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 166 transitions, 1189 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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:22:13,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:22:13,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 226 [2023-12-05 21:22:13,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:22:26,704 INFO L124 PetriNetUnfolderBase]: 51882/79932 cut-off events. [2023-12-05 21:22:26,705 INFO L125 PetriNetUnfolderBase]: For 295791/322927 co-relation queries the response was YES. [2023-12-05 21:22:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673873 conditions, 79932 events. 51882/79932 cut-off events. For 295791/322927 co-relation queries the response was YES. Maximal size of possible extension queue 2857. Compared 645862 event pairs, 51882 based on Foata normal form. 516/79764 useless extension candidates. Maximal degree in co-relation 548157. Up to 65533 conditions per place. [2023-12-05 21:22:27,165 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 0 selfloop transitions, 0 changer transitions 164/164 dead transitions. [2023-12-05 21:22:27,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 164 transitions, 1257 flow [2023-12-05 21:22:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:22:27,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:22:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-12-05 21:22:27,167 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7359882005899705 [2023-12-05 21:22:27,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-12-05 21:22:27,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-12-05 21:22:27,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:22:27,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-12-05 21:22:27,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:22:27,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:22:27,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 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:22:27,169 INFO L308 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-12-05 21:22:27,169 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 164 transitions, 1257 flow [2023-12-05 21:22:27,170 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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:22:27,176 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-6.wvr.c_BEv2_AllErrorsAtOnce [2023-12-05 21:22:27,209 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 30 remaining) [2023-12-05 21:22:27,209 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2023-12-05 21:22:27,209 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2023-12-05 21:22:27,209 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2023-12-05 21:22:27,210 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 30 remaining) [2023-12-05 21:22:27,211 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 30 remaining) [2023-12-05 21:22:27,211 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:22:27,212 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:22:27,214 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:22:27,214 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:22:27,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:22:27 BasicIcfg [2023-12-05 21:22:27,234 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:22:27,234 INFO L158 Benchmark]: Toolchain (without parser) took 128151.66ms. Allocated memory was 309.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 263.4MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2023-12-05 21:22:27,234 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:22:27,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.83ms. Allocated memory is still 309.3MB. Free memory was 262.9MB in the beginning and 250.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-05 21:22:27,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.56ms. Allocated memory is still 309.3MB. Free memory was 250.8MB in the beginning and 248.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:22:27,235 INFO L158 Benchmark]: Boogie Preprocessor took 37.47ms. Allocated memory is still 309.3MB. Free memory was 248.2MB in the beginning and 246.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:22:27,235 INFO L158 Benchmark]: RCFGBuilder took 554.35ms. Allocated memory is still 309.3MB. Free memory was 246.1MB in the beginning and 211.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-05 21:22:27,235 INFO L158 Benchmark]: TraceAbstraction took 127315.80ms. Allocated memory was 309.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 211.0MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2023-12-05 21:22:27,236 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.11ms. Allocated memory is still 179.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.83ms. Allocated memory is still 309.3MB. Free memory was 262.9MB in the beginning and 250.8MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.56ms. Allocated memory is still 309.3MB. Free memory was 250.8MB in the beginning and 248.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.47ms. Allocated memory is still 309.3MB. Free memory was 248.2MB in the beginning and 246.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 554.35ms. Allocated memory is still 309.3MB. Free memory was 246.1MB in the beginning and 211.5MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 127315.80ms. Allocated memory was 309.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 211.0MB in the beginning and 4.6GB in the end (delta: -4.4GB). Peak memory consumption was 4.5GB. 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 - 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 13 procedures, 280 locations, 30 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: 127.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 124.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 528 IncrementalHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 67 mSDtfsCounter, 528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1257occurred in iteration=9, InterpolantAutomatonStates: 27, 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.7s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 783 ConstructedInterpolants, 0 QuantifiedInterpolants, 4789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:22:27,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...